THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS AND ARBITRARILY MANY COLORS

DOI10.1017/jsl.2018.19zbMath1436.03098arXiv1711.08704OpenAlexW2963288642WikidataQ128775999 ScholiaQ128775999MaRDI QIDQ4647115

Theodore A. Slaman, Keita Yokoyama

Publication date: 4 January 2019

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.08704

zbMATH Keywords

reverse mathematicsconservationRamsey's theoremMathias forcingbounding\(B\Sigma^0_3\)double jump controlfirst-order part

Mathematics Subject Classification ID

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

Related Items (3)

The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem ⋮ (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE ⋮ In search of the first-order part of Ramsey's theorem for pairs

Cites Work

• Unnamed Item
• Unnamed Item
• The inductive strength of Ramsey's theorem for pairs
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• On the strength of Ramsey's theorem for pairs
• Slicing the Truth
• On recursion theory in IΣ₁

This page was built for publication: THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS AND ARBITRARILY MANY COLORS