Set existence principles and closure conditions: unravelling the standard view of reverse mathematics
Philosophia Mathematica 27 (2):153-176 (2019)
Abstract
It is a striking fact from reverse mathematics that almost all theorems of countable and countably representable mathematics are equivalent to just five subsystems of second order arithmetic. The standard view is that the significance of these equivalences lies in the set existence principles that are necessary and sufficient to prove those theorems. In this article I analyse the role of set existence principles in reverse mathematics, and argue that they are best understood as closure conditions on the powerset of the natural numbers.Author's Profile
Reprint years
2018
DOI
10.1093/philmat/nky010
My notes
Similar books and articles
Reverse Mathematics and Fully Ordered Groups.Reed Solomon - 1998 - Notre Dame Journal of Formal Logic 39 (2):157-189.
On the constructive notion of closure maps.Mohammad Ardeshir & Rasoul Ramezanian - 2012 - Mathematical Logic Quarterly 58 (4-5):348-355.
The Dirac delta function in two settings of Reverse Mathematics.Sam Sanders & Keita Yokoyama - 2012 - Archive for Mathematical Logic 51 (1-2):99-121.
Sequences of real functions on [0, 1] in constructive reverse mathematics.Hannes Diener & Iris Loeb - 2009 - Annals of Pure and Applied Logic 157 (1):50-61.
Minima of initial segments of infinite sequences of reals.Jeffry L. Hirst - 2004 - Mathematical Logic Quarterly 50 (1):47-50.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
Nonstandard arithmetic and reverse mathematics.H. Jerome Keisler - 2006 - Bulletin of Symbolic Logic 12 (1):100-125.
Reverse mathematics: the playground of logic.Richard A. Shore - 2010 - Bulletin of Symbolic Logic 16 (3):378-402.
Review of Denis R. Hirschfeldt, Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles. [REVIEW]Benedict Eastaugh - 2017 - Studia Logica 105 (4):873-879.
Reverse mathematics of prime factorization of ordinals.Jeffry L. Hirst - 1999 - Archive for Mathematical Logic 38 (3):195-201.
Reverse Mathematics and Ordinal Multiplication.Jeffry L. Hirst - 1998 - Mathematical Logic Quarterly 44 (4):459-464.
Nonstandard models in recursion theory and reverse mathematics.C. T. Chong, Wei Li & Yue Yang - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
The prehistory of the subsystems of second-order arithmetic.Walter Dean & Sean Walsh - 2017 - Review of Symbolic Logic 10 (2):357-396.
Reverse-engineering Reverse Mathematics.Sam Sanders - 2013 - Annals of Pure and Applied Logic 164 (5):528-541.
Non-standard analysis in ACA0 and Riemann mapping theorem.Keita Yokoyama - 2007 - Mathematical Logic Quarterly 53 (2):132-146.
Analytics
Added to PP
2018-02-20
Downloads
168 (#76,955)
6 months
34 (#38,346)
2018-02-20
Downloads
168 (#76,955)
6 months
34 (#38,346)
Historical graph of downloads
Author's Profile
Citations of this work
Review of John Stillwell, Reverse Mathematics: Proofs from the Inside Out. [REVIEW]Benedict Eastaugh - 2020 - Philosophia Mathematica 28 (1):108-116.
Does Choice Really Imply Excluded Middle? Part II: Historical, Philosophical, and Foundational Reflections on the Goodman–Myhill Result†.Neil Tennant - 2021 - Philosophia Mathematica 29 (1):28-63.
References found in this work
Partial realizations of Hilbert's program.Stephen G. Simpson - 1988 - Journal of Symbolic Logic 53 (2):349-363.
Open questions in reverse mathematics.Antonio Montalbán - 2011 - Bulletin of Symbolic Logic 17 (3):431-454.
Factorization of polynomials and °1 induction.S. G. Simpson - 1986 - Annals of Pure and Applied Logic 31:289.