The weakness of the pigeonhole principle under hyperarithmetical reductions

DOI10.1142/S0219061321500136MaRDI QIDQ5163163

Benoit Monin, Ludovic Patey

Publication date: 3 November 2021

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

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

zbMATH Keywords

computability theorypigeonhole principleRamsey's theoryhyperarithmetical reduction

Mathematics Subject Classification ID

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

Related Items (1)

The coding power of a product of partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cohesive sets and rainbows
• The weakness of being cohesive, thin or free in reverse mathematics
• The thin set theorem for pairs implies DNR
• On the strength of Ramsey's theorem
• Combinatorial principles between \(\text{RRT}_2^2\) and \(\text{RT}_2^2\)
• Pigeons do not jump high
• Some logically weak Ramseyan theorems
• On the strength of Ramsey's theorem for pairs
• Rainbow Ramsey Theorem for Triples is Strictly Weaker than the Arithmetical Comprehension Axiom
• RT₂² does not imply WKL₀
• Higher randomness and forcing with closed sets
• Recursive well-orderings
• Ramsey's theorem and cone avoidance
• The strength of the rainbow Ramsey Theorem
• Iterative forcing and hyperimmunity in reverse mathematics
• HIGHER RANDOMNESS AND GENERICITY
• Thin set theorems and cone avoidance
• OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS
• Cone avoiding closed sets
• Measure-Theoretic Uniformity in Recursion Theory and Set Theory
• ∏ 0 1 Classes and Degrees of Theories
• Ramsey's theorem and recursion theory

This page was built for publication: The weakness of the pigeonhole principle under hyperarithmetical reductions