Ramsey's theorem for trees: the polarized tree theorem and notions of stability

DOI10.1007/S00153-010-0179-6zbMath1215.03018OpenAlexW2000565016MaRDI QIDQ964459

Damir D. Dzhafarov, Tamara J. Lakins, Jeffry L. Hirst

Publication date: 15 April 2010

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-010-0179-6

zbMATH Keywords

polarized version of Ramsey's theorem for trees

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)

Related Items (4)

Open Questions in Reverse Mathematics ⋮ Coloring trees in reverse mathematics ⋮ THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS ⋮ The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma

Cites Work

• Unnamed Item
• Unnamed Item
• The polarized Ramsey's theorem
• On the strength of Ramsey's theorem for pairs
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
• Reverse mathematics, computability, and partitions of trees
• Corrigendum to: “On the strength of Ramsey's Theorem for pairs”
• Generalized cohesiveness
• Ramsey's theorem and recursion theory

This page was built for publication: Ramsey's theorem for trees: the polarized tree theorem and notions of stability