THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS

DOI10.1017/JSL.2015.80zbMath1368.03019arXiv1505.01057OpenAlexW2962823038MaRDI QIDQ2976343

Ludovic Patey

Publication date: 28 April 2017

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

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

zbMATH Keywords

TTreverse mathematicsRamsey's theoremWKLiterative forcingRTtree theorem

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 (5)

Separating principles below ⋮ Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective ⋮ On the logical strengths of partial solutions to mathematical problems ⋮ The Ginsburg-Sands theorem and computability theory ⋮ The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma

Cites Work

• Unnamed Item
• Ramsey-type graph coloring and diagonal non-computability
• Ramsey's theorem for trees: the polarized tree theorem and notions of stability
• On the strength of Ramsey's theorem
• On degrees of unsolvability
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Iterative Forcing and Hyperimmunity in Reverse Mathematics
• SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS
• Cohesive avoidance and strong reductions

This page was built for publication: THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS