Dominating the Erdős-Moser theorem in reverse mathematics

DOI10.1016/j.apal.2016.11.011zbMath1422.03019arXiv1505.03425OpenAlexW2963745382MaRDI QIDQ2400499

Ludovic Patey

Publication date: 29 August 2017

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

reverse mathematicscohesivenessErdős-Moser theorematomic model theorem

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Cites Work

• On the strength of the finite intersection principle
• Primitive recursion and the chain antichain principle
• Degrees bounding principles and universal instances in reverse mathematics
• The weakness of being cohesive, thin or free in reverse mathematics
• Lowness for genericity
• Ramsey-type graph coloring and diagonal non-computability
• On the strength of Ramsey's theorem
• The strength of infinitary Ramseyan principles can be accessed by their densities
• On degrees of unsolvability
• On the strength of Ramsey's theorem for pairs
• Turing Computability
• STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES
• THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES
• Open Questions in Reverse Mathematics
• On notions of computability-theoretic reduction between Π21 principles
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Slicing the Truth
• Iterative Forcing and Hyperimmunity in Reverse Mathematics
• Independence Results on the Global Structure of the Turing Degrees
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
• Classifying model-theoretic properties
• The atomic model theorem and type omitting
• Accessible Independence Results for Peano Arithmetic
• Minimal degrees and the jump operator
• Hyperarithmetically Encodable Sets
• A cohesive set which is not high
• Any FIP real computes a 1-generic
• The finite intersection principle and genericity
• SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS