On Robust Theorems Due to Bolzano, Weierstrass, Jordan, and Cantor

Journal of Symbolic Logic:1-51 (forthcoming)
  Copy   BIBTEX


Reverse Mathematics (RM hereafter) is a program in the foundations of mathematics where the aim is to identify theminimalaxioms needed to prove a given theorem from ordinary, i.e., non-set theoretic, mathematics. This program has unveiled surprising regularities: the minimal axioms are very oftenequivalentto the theorem over thebase theory, a weak system of ‘computable mathematics’, while most theorems are either provable in this base theory, or equivalent to one of onlyfourlogical systems. The latter plus the base theory are called the ‘Big Five’ and the associated equivalences arerobustfollowing Montalbán, i.e., stable under small variations of the theorems at hand. Working in Kohlenbach’shigher-orderRM, we obtain two new and long series of equivalences based on theorems due to Bolzano, Weierstrass, Jordan, and Cantor; these equivalences are extremely robust and have no counterpart among the Big Five systems. Thus, higher-order RM is much richer than its second-order cousin, boasting at least two extra ‘Big’ systems.



    Upload a copy of this work     Papers currently archived: 94,593

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

The Biggest Five of Reverse Mathematics.Dag Normann & Sam Sanders - forthcoming - Journal of Mathematical Logic.
Big in Reverse Mathematics: The Uncountability of the Reals.Sam Sanders - forthcoming - Journal of Symbolic Logic:1-34.
Refining the Taming of the Reverse Mathematics Zoo.Sam Sanders - 2018 - Notre Dame Journal of Formal Logic 59 (4):579-597.
Splittings and Disjunctions in Reverse Mathematics.Sam Sanders - 2020 - Notre Dame Journal of Formal Logic 61 (1):51-74.
Reverse Mathematics of Topology: Dimension, Paracompactness, and Splittings.Sam Sanders - 2020 - Notre Dame Journal of Formal Logic 61 (4):537-559.
On the Uncountability Of.Dag Normann & Sam Sanders - 2022 - Journal of Symbolic Logic 87 (4):1474-1521.
Representations and the Foundations of Mathematics.Sam Sanders - 2022 - Notre Dame Journal of Formal Logic 63 (1):1-28.
Reverse Mathematics.John Stillwell - 2024 - In Bharath Sriraman (ed.), Handbook of the History and Philosophy of Mathematical Practice. Cham: Springer. pp. 1963-1988.
The Strength of an Axiom of Finite Choice for Branches in Trees.G. O. H. Jun Le - 2023 - Journal of Symbolic Logic 88 (4):1367-1386.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.


Added to PP

14 (#1,015,774)

6 months
12 (#313,206)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Sam Sanders
Ruhr-Universität Bochum
Dag Normann
University of Oslo

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.
Pincherle's theorem in reverse mathematics and computability theory.Dag Normann & Sam Sanders - 2020 - Annals of Pure and Applied Logic 171 (5):102788.

View all 22 references / Add more references