Weaker cousins of Ramsey's theorem over a weak base theory

被引:3
作者
Fiori-Carones, Marta [1 ]
Kolodziejczyk, Leszek Aleksander [1 ]
Kowalik, Katarzyna W. [1 ]
机构
[1] Univ Warsaw, Inst Math, Banacha 2, PL-02097 Warsaw, Poland
关键词
Reverse mathematics; Ramsey's theorem; Models of arithmetic; Conservation theorems; COMBINATORIAL PRINCIPLES WEAKER; STRENGTH;
D O I
10.1016/j.apal.2021.103028
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The paper is devoted to a reverse-mathematical study of some well-known consequences of Ramsey's theorem for pairs, focused on the chain-antichain principle CAC, the ascending-descending sequence principle ADS, and the Cohesive Ramsey Theorem for pairs CRT22. We study these principles over the base theory RCA(0)*, which is weaker than the usual base theory RCA(0) considered in reverse mathematics in that it allows only Delta(0)(1)-induction as opposed to Sigma(0)(1)-induction. In RCA(0)*, it may happen that an unbounded subset of N is not in bijective correspondence with N. Accordingly, Ramsey-theoretic principles split into at least two variants, "normal" and "long", depending on the sense in which the set witnessing the principle is required to be infinite. We prove that the normal versions of our principles, like that of Ramsey's theorem for pairs and two colours, are equivalent to their relativizations to proper Sigma(0)(1)-definable cuts. Because of this, they are all Pi(0)(3)- but not Pi(1)(1)-conservative over RCA(0)*, and, in any model of RCA(0)* + -RCA(0), if they are true then they are computably true relative to some set. The long versions exhibit one of two behaviours: they either imply RCA(0) over RCA(0)* or are Pi(0)(3)-conservative over RCA(0)*. The conservation results are obtained using a variant of the so-called grouping principle. We also show that the cohesive set principle COH, a strengthening of CRT22, is never computably true in a model of RCA(0)* and, as a consequence, does not follow from RT22 over RCA(0)*. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数:22
相关论文
共 25 条
[1]   The uniform content of partial and linear orders [J].
Astor, Eric P. ;
Dzhafarov, Damir D. ;
Solomon, Reed ;
Suggs, Jacob .
ANNALS OF PURE AND APPLIED LOGIC, 2017, 168 (06) :1153-1171
[2]  
Belanger D. A., 2015, CONSERVATION THEOREM
[3]   On the strength of Ramsey's theorem for pairs [J].
Cholak, PA ;
Jockusch, CG ;
Slaman, TA .
JOURNAL OF SYMBOLIC LOGIC, 2001, 66 (01) :1-55
[4]   ON THE STRENGTH OF RAMSEY'S THEOREM FOR PAIRS (vol 66, pg 1, 2001) [J].
Cholak, Peter A. ;
Jockusch, Carl G., Jr. ;
Slaman, Theodore A. .
JOURNAL OF SYMBOLIC LOGIC, 2009, 74 (04) :1438-1439
[5]   The jump of a Σn-cut [J].
Chong, C. T. ;
Yang, Yue .
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2007, 75 :690-704
[6]   Π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
[7]   THE DEGREE OF A SIGMA-N CUT [J].
CHONG, CT ;
MOURAD, KJ .
ANNALS OF PURE AND APPLIED LOGIC, 1990, 48 (03) :227-235
[8]   Unifying the model theory of first-order and second-order arithmetic via WKL0 [J].
Enayat, Ali ;
Wong, Tin Lok .
ANNALS OF PURE AND APPLIED LOGIC, 2017, 168 (06) :1247-1283
[9]  
Fiori-Carones Marta, ISOMORPHISM TH UNPUB, V2021
[10]  
Hirschfeldt D. R., 2015, Lecture Notes Series. Institute for Mathematical Sciences