Pigeons do not jump high

DOI10.1016/j.aim.2019.06.026zbMath1441.03013arXiv1803.09771OpenAlexW2963621191MaRDI QIDQ2313367

Benoit Monin, Ludovic Patey

Publication date: 19 July 2019

Published in: Advances in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

reverse mathematicsRamsey's theoremMathias forcingSRTpigeonhole principle

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)

Related Items (5)

RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION ⋮ Computing sets from all infinite subsets ⋮ The weakness of the pigeonhole principle under hyperarithmetical reductions ⋮ \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models ⋮ The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma

Cites Work

• 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
• The polarized Ramsey's theorem
• On the strength of Ramsey's theorem
• Combinatorial principles between \(\text{RRT}_2^2\) and \(\text{RT}_2^2\)
• Generics for computable Mathias forcing
• Some logically weak Ramseyan theorems
• On the strength of Ramsey's theorem for pairs
• A Δ₂⁰ set with no infinite low subset in either it or its complement
• Rainbow Ramsey Theorem for Triples is Strictly Weaker than the Arithmetical Comprehension Axiom
• RT₂² does not imply WKL₀
• THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Partition Theorems and Computability Theory
• The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
• On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
• Ramsey's theorem and cone avoidance
• The strength of the rainbow Ramsey Theorem
• A cohesive set which is not high
• Iterative forcing and hyperimmunity in reverse mathematics
• Reverse mathematics and a Ramsey-type König's Lemma
• OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS
• Cone avoiding closed sets
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• ∏ 0 1 Classes and Degrees of Theories
• Ramsey's theorem and recursion theory

This page was built for publication: Pigeons do not jump high