The modal logic of Reverse Mathematics
- 96 Downloads
The implication relationship between subsystems in Reverse Mathematics has an underlying logic, which can be used to deduce certain new Reverse Mathematics results from existing ones in a routine way. We use techniques of modal logic to formalize the logic of Reverse Mathematics into a system that we name s-logic. We argue that s-logic captures precisely the “logical” content of the implication and nonimplication relations between subsystems in Reverse Mathematics. We present a sound, complete, decidable, and compact tableau-style deductive system for s-logic, and explore in detail two fragments that are particularly relevant to Reverse Mathematics practice and automated theorem proving of Reverse Mathematics results.
KeywordsMathematics Modal logic Strict implication Automated reasoning
Mathematics Subject Classification03B30 03B45
Unable to display preview. Download preview PDF.
- 2.Blackburn P., von Benthem J.: Modal Logic: A Semantic Perspective, Handbook of Modal Logic, Studies in Logic and Practical Reasoning, vol. 3. Elsevier, Amsterdam (2007)Google Scholar
- 4.Hacking, I.: What is strict implication? J. Symb. Log. 28, 51–71 (1963)Google Scholar
- 7.Mints G.: A Short Introduction to Modal Logic, CSLI Lecture Notes, vol. 30. Stanford University Center for the Study of Language and Information, Stanford, CA (1992)Google Scholar
- 8.Simpson, S.G.: Subsystems of Second Order Arithmetic, 2nd edn. Perspectives in Logic. Cambridge University Press, Cambridge (2009)Google Scholar