In search of the first-order part of Ramsey's theorem for pairs

DOI10.1007/978-3-030-80049-9_27OpenAlexW3185994086MaRDI QIDQ2117792

Keita Yokoyama, Leszek Aleksander Kołodziejczyk

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80049-9_27

zbMATH Keywords

reverse mathematicsfirst-order strengthRamey's theorem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
• The inductive strength of Ramsey's theorem for pairs
• The degree of a \(\Sigma_ n\) cut
• Rapidly growing Ramsey functions
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• On the strength of Ramsey's theorem
• Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
• Weaker cousins of Ramsey's theorem over a weak base theory
• The strength of infinitary Ramseyan principles can be accessed by their densities
• On the strength of Ramsey's theorem for pairs
• RT₂² does not imply WKL₀
• On principles between ∑1- and ∑2-induction, and monotone enumerations
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Some independence results for Peano arithmetic
• THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS AND ARBITRARILY MANY COLORS
• Constructing κ-like Models of Arithmetic
• On the strength of Ramsey's theorem without Σ₁‐induction
• Ramsey's theorem and recursion theory

This page was built for publication: In search of the first-order part of Ramsey's theorem for pairs