Reverse mathematics and Peano categoricity

被引:14
作者
Simpson, Stephen G. [1 ]
Yokoyama, Keita [2 ]
机构
[1] Penn State Univ, Dept Math, University Pk, PA 16802 USA
[2] Tokyo Inst Technol, Dept Math & Comp Sci, Tokyo, Japan
基金
日本学术振兴会;
关键词
Reverse mathematics; Second-order arithmetic; Peano system; Foundations of mathematics; Proof theory; Second-order logic; COMBINATORIAL PRINCIPLES WEAKER; RAMSEYS THEOREM;
D O I
10.1016/j.apal.2012.10.014
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 is an element of A and f : A -> A. A subset X subset of A is said to be inductive if i is an element of X and for all a (a is an element of X double right arrow f (a) is an element of 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 is not an element of 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) = n + 1 for all n is an element of 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 RCA(0)*. From this and similar equivalences we draw some foundational/philosophical consequences. (c) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:284 / 293
页数:10
相关论文
共 24 条
[1]  
[Anonymous], 2010, LECT NOTES LOG
[2]   Π11-conservation of combinatorial principles weaker than Ramsey's theorem for pairs [J].
Chong, C. T. ;
Slaman, Theodore A. ;
Yang, Yue .
ADVANCES IN MATHEMATICS, 2012, 230 (03) :1060-1077
[3]  
Dedekind R., 1872, Stetigkeit und irrationale Zahlen
[4]  
Dedekind Richard., 1888, Was sind und was sollen die Zahlen?
[5]  
Dedekind Richard, 1963, Essays on the Theory of Numbers
[6]  
FEFERMAN S., 2010, LECT NOTES LOG, V33
[7]  
FRIEDMAN H, 1976, J SYMBOLIC LOGIC, V41, P557
[8]  
Friedman H., 1975, P 17 INT C MATH VANC, V1, P235
[9]   Concerning infinity [J].
Hilbert, D .
MATHEMATISCHE ANNALEN, 1926, 95 :161-190
[10]   Combinatorial principles weaker than Ramsey's theorem for pairs [J].
Hirschfeldt, Denis R. ;
Shore, Richard A. .
JOURNAL OF SYMBOLIC LOGIC, 2007, 72 (01) :171-206