Refining the Taming of the Reverse Mathematics Zoo

Notre Dame Journal of Formal Logic 59 (4):579-597 (2018)
  Copy   BIBTEX


Reverse mathematics is a program in the foundations of mathematics. It provides an elegant classification in which the majority of theorems of ordinary mathematics fall into only five categories, based on the “big five” logical systems. Recently, a lot of effort has been directed toward finding exceptional theorems, that is, those which fall outside the big five. The so-called reverse mathematics zoo is a collection of such exceptional theorems. It was previously shown that a number of uniform versions of the zoo theorems, that is, where a functional computes the objects stated to exist, fall in the third big five category, arithmetical comprehension, inside Kohlenbach’s higher-order reverse mathematics. In this paper, we extend and refine these previous results. In particular, we establish analogous results for recent additions to the reverse mathematics zoo, thus establishing that the latter disappear at the uniform level. Furthermore, we show that the aforementioned equivalences can be proved using only intuitionistic logic. Perhaps most surprisingly, these explicit equivalences are extracted from nonstandard equivalences in Nelson’s internal set theory, and we show that the nonstandard equivalence can be recovered from the explicit ones. Finally, the following zoo theorems are studied in this paper: Π10G, FIP, 1-GEN, OPT, AMT, SADS, AST, NCS, and KPT.



    Upload a copy of this work     Papers currently archived: 77,952

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Reverse-engineering Reverse Mathematics.Sam Sanders - 2013 - Annals of Pure and Applied Logic 164 (5):528-541.
The Dirac delta function in two settings of Reverse Mathematics.Sam Sanders & Keita Yokoyama - 2012 - Archive for Mathematical Logic 51 (1-2):99-121.
Reverse mathematics: the playground of logic.Richard A. Shore - 2010 - Bulletin of Symbolic Logic 16 (3):378-402.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
Questioning Constructive Reverse Mathematics.I. Loeb - 2012 - Constructivist Foundations 7 (2):131-140.
Erna and Friedman's reverse mathematics.Sam Sanders - 2011 - Journal of Symbolic Logic 76 (2):637 - 664.
A Nonstandard Counterpart of WWKL.Stephen G. Simpson & Keita Yokoyama - 2011 - Notre Dame Journal of Formal Logic 52 (3):229-243.
Nonstandard arithmetic and reverse mathematics.H. Jerome Keisler - 2006 - Bulletin of Symbolic Logic 12 (1):100-125.
Nonstandard arithmetic and recursive comprehension.H. Keisler - 2010 - Annals of Pure and Applied Logic 161 (8):1047-1062.
Nonstandard arithmetic and recursive comprehension.H. Jerome Keisler - 2010 - Annals of Pure and Applied Logic 161 (8):1047-1062.
Reverse Mathematics and Recursive Graph Theory.William Gasarch & Jeffry L. Hirst - 1998 - Mathematical Logic Quarterly 44 (4):465-473.


Added to PP

11 (#854,082)

6 months
1 (#485,425)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Sam Sanders
Ruhr-Universität Bochum

Citations of this work

No citations found.

Add more citations

References found in this work

Open questions in reverse mathematics.Antonio Montalbán - 2011 - Bulletin of Symbolic Logic 17 (3):431-454.
A functional interpretation for nonstandard arithmetic.Benno van den Berg, Eyvind Briseid & Pavol Safarik - 2012 - Annals of Pure and Applied Logic 163 (12):1962-1994.
Measure theory and weak König's lemma.Xiaokang Yu & Stephen G. Simpson - 1990 - Archive for Mathematical Logic 30 (3):171-180.
Located sets and reverse mathematics.Mariagnese Giusto & Stephen G. Simpson - 2000 - Journal of Symbolic Logic 65 (3):1451-1480.

View all 9 references / Add more references