THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS

DOI10.1017/jsl.2021.98OpenAlexW3216167597WikidataQ113858281 ScholiaQ113858281MaRDI QIDQ5070472

Lu Liu, Ludovic Patey

Publication date: 12 April 2022

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

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

zbMATH Keywords

computability theoryreverse mathematicsthin set theoremErdős-Moser theoremfree set theorem

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degrees bounding principles and universal instances in reverse mathematics
• The weakness of being cohesive, thin or free in reverse mathematics
• Classical recursion theory. The theory of functions and sets of natural numbers.
• On the strength of Ramsey's theorem
• The strength of infinitary Ramseyan principles can be accessed by their densities
• Some logically weak Ramseyan theorems
• RT₂² does not imply WKL₀
• Open Questions in Reverse Mathematics
• Partial Orders and Immunity in Reverse Mathematics
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS
• SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS
• Cone avoiding closed sets
• ∏ 0 1 Classes and Degrees of Theories
• Ramsey's theorem and recursion theory

This page was built for publication: THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS