On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
From MaRDI portal
Publication:3550582
DOI10.1090/S0002-9939-09-10115-6zbMath1195.03015OpenAlexW1966303569MaRDI QIDQ3550582
Steffen Lempp, Yue Yang, Chi Tat Chong
Publication date: 31 March 2010
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9939-09-10115-6
reverse mathematicslinear orderRamsey's Theorem\(\Sigma^0_2\)-boundingbi-tame cutpolarized Ramsey's Theoremtame cut
Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)
Related Items
Open Questions in Reverse Mathematics ⋮ Reduction games, provability and compactness ⋮ Computable Reductions and Reverse Mathematics ⋮ The metamathematics of Stable Ramsey’s Theorem for Pairs ⋮ NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS ⋮ The uniform content of partial and linear orders ⋮ The reverse mathematics of non-decreasing subsequences ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ Ramsey’s theorem for singletons and strong computable reducibility ⋮ Variations of statement, variations of strength. The case of the Rival-Sands theorems ⋮ ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM ⋮ Controlling iterated jumps of solutions to combinatorial problems ⋮ (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE ⋮ \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs ⋮ Effectiveness of Hindman’s Theorem for Bounded Sums ⋮ Weakly Represented Families in Reverse Mathematics ⋮ STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES ⋮ Reverse mathematics and a Ramsey-type König's Lemma ⋮ The weakness of being cohesive, thin or free in reverse mathematics ⋮ A weak variant of Hindman's theorem stronger than Hilbert's theorem ⋮ The inductive strength of Ramsey's theorem for pairs ⋮ Ramsey's theorem for trees: the polarized tree theorem and notions of stability ⋮ On the indecomposability of \(\omega^n\) ⋮ New bounds on the strength of some restrictions of Hindman's theorem ⋮ \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models ⋮ Pigeons do not jump high ⋮ Effectiveness for the dual Ramsey theorem ⋮ Cohesive avoidance and strong reductions ⋮ COH, SRT 2 2 , and multiple functionals ⋮ Schmerl decompositions in first order arithmetic ⋮ Linear extensions of partial orders and reverse mathematics
Cites Work
- Unnamed Item
- Unnamed Item
- The polarized Ramsey's theorem
- \(\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
- A partition calculus in set theory
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- An α-finite injury method of the unbounded type
- Σ_{𝑛}-bounding and Δ_{𝑛}-induction
- On suborderings of the α-recursively enumerable α-degrees
