The reverse mathematics of \textsf{CAC for trees}

DOI10.1017/jsl.2023.27MaRDI QIDQ6642882

William Gaudelier, Julien Cervelle, Ludovic Patey

Publication date: 25 November 2024

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

zbMATH Keywords

Ramseyreverse mathematicschain antichain

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Applications of computability and recursion theory (03D80)

Cites Work

• Unnamed Item
• Self-embeddings of computable trees
• On the strength of Ramsey's theorem for pairs
• Infinite chains and antichains in computable partial orderings
• On uniform relationships between combinatorial problems
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
• The atomic model theorem and type omitting
• Reverse mathematics and a Ramsey-type König's Lemma
• Reduction games, provability and compactness
• RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION
• Where pigeonhole principles meet Koenig lemmas
• SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS
• ∏ 0 1 Classes and Degrees of Theories

This page was built for publication: The reverse mathematics of \textsf{CAC for trees}