\(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs (Q436224): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q2260473 |
Changed an Item |
||
Property / author | |||
Property / author: Chi Tat Chong / rank | |||
Normal rank |
Revision as of 11:15, 1 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs |
scientific article |
Statements
\(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs (English)
0 references
20 July 2012
0 references
This paper solves some important problems in the context of determining the strength, in the sense of reverse mathematics, of Ramsey's theorem for pairs (\(\mathrm{RT}^2_2\)). In more detail, for \(\mathrm{RT}^2_2\) it is known that the \(\Pi^1_1\)-consequences of it relative to the system \(\mathsf{RCA}_0\) lie between \(\Sigma^0_2\)-bounding and \(\Sigma^0_2\)-induction; see [\textit{P. Cholak} et al., J. Symb. Log. 66, No.~1, 1--55 (2001; Zbl 0977.03033)]. In this paper the authors show that the \(\Pi^1_1\)-consequences of the cohesive principles, the ascending-descending principle and the chain-antichain principle -- all consequences of \(\mathrm{RT}^2_2\) -- coincide with those of \(\Sigma^0_2\)-bounding. These results are proven using forcing over nonstandard models.
0 references
reverse mathematics
0 references
\(\Pi^1_1\)-conservation
0 references
RCA\(_0
0 references
\Sigma^0_2\)-bounding
0 references
combinatorial principles
0 references
cohesiveness
0 references
Ramsey's theorem for pairs
0 references
ascending-descending principle
0 references
chain-antichain principle
0 references