The polarized Ramsey's theorem
From MaRDI portal
Publication:1014283
DOI10.1007/s00153-008-0108-0zbMath1172.03007OpenAlexW2024864091MaRDI QIDQ1014283
Jeffry L. Hirst, Damir D. Dzhafarov
Publication date: 27 April 2009
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-008-0108-0
Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35)
Related Items (11)
Reverse Mathematics: The Playground of Logic ⋮ Open Questions in Reverse Mathematics ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics ⋮ A weak variant of Hindman's theorem stronger than Hilbert's theorem ⋮ 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 ⋮ Partitions of trees and \({{\text \textsf{ACA}}^\prime_{0}}\) ⋮ Pigeons do not jump high ⋮ Restrictions of Hindman's theorem: an overview
Cites Work
- Unnamed Item
- Unnamed Item
- On the strength of Ramsey's theorem
- Countable retracing functions and \(\Pi_2^0\) predicates
- On the strength of Ramsey's theorem for pairs
- A Δ20 set with no infinite low subset in either it or its complement
- A partition calculus in set theory
- Partition Theorems and Computability Theory
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
- Located sets and reverse mathematics
- Ramsey's theorem and recursion theory
This page was built for publication: The polarized Ramsey's theorem
