Reverse mathematics and Peano categoricity
Annals of Pure and Applied Logic 164 (3):284-293 (2013)
Abstract
We investigate the reverse-mathematical status of several theorems to the effect that the natural number system is second-order categorical. One of our results is as follows. Define a system to be a triple A,i,f such that A is a set and i∈A and f:A→A. A subset X⊆A is said to be inductive if i∈X and ∀a ∈X). The system A,i,f is said to be inductive if the only inductive subset of A is A itself. Define a Peano system to be an inductive system such that f is one-to-one and i∉the range of f. The standard example of a Peano system is N,0,S where N={0,1,2,…,n,…}=the set of natural numbers and S:N→N is given by S=n+1 for all n∈N. Consider the statement that all Peano systems are isomorphic to N,0,S. We prove that this statement is logically equivalent to WKL0 over RCA0⁎ source. From this and similar equivalences we draw some foundational/philosophical consequencesDOI
10.1016/j.apal.2012.10.014
My notes
Similar books and articles
The Dirac delta function in two settings of Reverse Mathematics.Sam Sanders & Keita Yokoyama - 2012 - Archive for Mathematical Logic 51 (1-2):99-121.
A Nonstandard Counterpart of WWKL.Stephen G. Simpson & Keita Yokoyama - 2011 - Notre Dame Journal of Formal Logic 52 (3):229-243.
Questioning Constructive Reverse Mathematics.I. Loeb - 2012 - Constructivist Foundations 7 (2):131-140.
Open questions in reverse mathematics.Antonio Montalbán - 2011 - Bulletin of Symbolic Logic 17 (3):431-454.
Reverse mathematics: the playground of logic.Richard A. Shore - 2010 - Bulletin of Symbolic Logic 16 (3):378-402.
Reverse mathematics of separably closed sets.Jeffry L. Hirst - 2006 - Archive for Mathematical Logic 45 (1):1-2.
Undecidable theories and reverse mathematics.James H. Schmerl - 2005 - In Stephen Simpson (ed.), Reverse Mathematics 2001. pp. 21--349.
Free sets and reverse mathematics.Carl G. Jockusch Jr - 2005 - In Stephen Simpson (ed.), Reverse Mathematics 2001. pp. 104.
Reverse mathematics and a Ramsey-type König's Lemma.Stephen Flood - 2012 - Journal of Symbolic Logic 77 (4):1272-1280.
Reverse mathematics of prime factorization of ordinals.Jeffry L. Hirst - 1999 - Archive for Mathematical Logic 38 (3):195-201.
Derived sequences and reverse mathematics.Jeffry L. Hirst - 1993 - Mathematical Logic Quarterly 39 (1):447-453.
String theory.John Corcoran, William Frank & Michael Maloney - 1974 - Journal of Symbolic Logic 39 (4):625-637.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
Analytics
Added to PP
2013-12-12
Downloads
40 (#293,979)
6 months
2 (#299,341)
2013-12-12
Downloads
40 (#293,979)
6 months
2 (#299,341)
Historical graph of downloads
Citations of this work
Stable and Unstable Theories of Truth and Syntax.Beau Madison Mount & Daniel Waxman - 2021 - Mind 130 (518):439-473.
Internal Categoricity in Arithmetic and Set Theory.Jouko Väänänen & Tong Wang - 2015 - Notre Dame Journal of Formal Logic 56 (1):121-134.
On the strength of Ramsey's theorem without Σ1 -induction.Keita Yokoyama - 2013 - Mathematical Logic Quarterly 59 (1-2):108-111.
Categorical characterizations of the natural numbers require primitive recursion.Leszek Aleksander Kołodziejczyk & Keita Yokoyama - 2015 - Annals of Pure and Applied Logic 166 (2):219-231.
References found in this work
Partial realizations of Hilbert's program.Stephen G. Simpson - 1988 - Journal of Symbolic Logic 53 (2):349-363.
Combinatorial principles weaker than Ramsey's Theorem for pairs.Denis R. Hirschfeldt & Richard A. Shore - 2007 - Journal of Symbolic Logic 72 (1):171-206.