The inductive strength of Ramsey's theorem for pairs

DOI10.1016/J.AIM.2016.11.036zbMATH Open1423.03047OpenAlexW2565215485MaRDI QIDQ507201FDOQ507201

Yue Yang, Theodore A. Slaman, C. T. Chong

Publication date: 3 February 2017

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aim.2016.11.036

Recommendations

• On the strength of Ramsey's theorem
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• On the strength of Ramsey's theorem for pairs
• The strength of Ramsey's theorem for pairs over trees. I: Weak König's lemma
• Ramsey's theorem for pairs and provably recursive functions

zbMATH Keywords

reverse mathematicsRamsey's theorem for pairs\(\mathrm{RCA}_0\)\(\operatorname{\Sigma}_2^0\)-boundingstable Ramsey's theorem for pairs

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)

Cites Work

• On the strength of Ramsey's theorem for pairs
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
• Σ_{𝑛}-bounding and Δ_{𝑛}-induction
• Ramsey's theorem and recursion theory
• The degree of a \(\Sigma_ n\) cut
• Corrigendum to: ``On the strength of Ramsey's theorem for pairs
• On the role of the collection principle for \(\Sigma ^0_2\)-formulas in second-order reverse mathematics
• Completeness Theorems, Incompleteness Theorems and Models of Arithmetic

Cited In (18)

• On the strength of Ramsey's theorem for pairs
• Where pigeonhole principles meet Koenig lemmas
• Conservation strength of the infinite pigeonhole principle for trees
• Some Questions in Computable Mathematics
• Variations of statement, variations of strength. The case of the Rival-Sands theorems
• In search of the first-order part of Ramsey's theorem for pairs
• On principles between ∑1- and ∑2-induction, and monotone enumerations
• The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma
• Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
• (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE
• THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS AND ARBITRARILY MANY COLORS
• The Ginsburg-Sands theorem and computability theory
• Book review of: D. R. Hirschfeldt, Slicing the truth. On the computable and reverse mathematics of combinatorial principles
• Proving Ramsey's theory by the cover set induction: A case and comparision study.
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• On the strength of Ramsey's theorem for trees
• HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK?
• Ramsey's theorem for pairs and provably recursive functions

This page was built for publication: The inductive strength of Ramsey's theorem for pairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507201)