\(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
From MaRDI portal
Publication:436224
DOI10.1016/j.aim.2012.02.025zbMath1255.03025OpenAlexW1998461400MaRDI QIDQ436224
Theodore A. Slaman, Yue Yang, Chi Tat Chong
Publication date: 20 July 2012
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aim.2012.02.025
reverse mathematicscohesivenesschain-antichain principle\(\Pi^1_1\)-conservation\Sigma^0_2\)-boundingascending-descending principlecombinatorial principlesRamsey's theorem for pairsRCA\(_0
Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35) Nonstandard models in mathematics (03H05)
Related Items
Reverse mathematical bounds for the termination theorem, Inductive inference and reverse mathematics, The proof-theoretic strength of Ramsey's theorem for pairs and two colors, Term extraction and Ramsey's theorem for pairs, NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS, Program extraction for 2-random reals, On the strength of Ramsey's theorem for trees, The thin set theorem for pairs implies DNR, Variations of statement, variations of strength. The case of the Rival-Sands theorems, (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE, Primitive recursion and the chain antichain principle, Weakly Represented Families in Reverse Mathematics, Weaker cousins of Ramsey's theorem over a weak base theory, The inductive strength of Ramsey's theorem for pairs, On the strength of Ramsey's theorem without Σ1‐induction, From Bolzano‐Weierstraß to Arzelà‐Ascoli, COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTION, In search of the first-order part of Ramsey's theorem for pairs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The degree of a \(\Sigma_ n\) cut
- \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator
- On the strength of Ramsey's theorem for pairs
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
- The atomic model theorem and type omitting
- Corrigendum to: “On the strength of Ramsey's Theorem for pairs”
- Finite injury and Σ1-induction
- Splitting an α-Recursively Enumerable Set
- A cohesive set which is not high
- Σ_{𝑛}-bounding and Δ_{𝑛}-induction
- ∏ 0 1 Classes and Degrees of Theories