\(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs (Q436224): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the strength of Ramsey's theorem for pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to: “On the strength of Ramsey's Theorem for pairs” / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degree of a \(\Sigma_ n\) cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial principles weaker than Ramsey's Theorem for pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The atomic model theorem and type omitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: ∏ 0 1 Classes and Degrees of Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3884109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite injury and <i>Σ</i><sub>1</sub>-induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting an α-Recursively Enumerable Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Σ_{𝑛}-bounding and Δ_{𝑛}-induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cohesive set which is not high / rank
 
Normal rank

Latest revision as of 12:30, 5 July 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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references