SRT₂^2 does not imply RT₂^2 in -models

DOI10.1016/J.AIM.2021.107903MaRDI QIDQ2048618zbMATH OpenOpenAlexFDO

Authors Benoit Monin, Ludovic Patey

Publication date 23 August 2021

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

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

zbMATH Keywords

cohesivenesspigeonhole principleRamsey's theorem for pairsreverse mathematics

Mathematics Subject Classification ID

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

Recommendations

• On the strength of Ramsey's theorem for pairs
• The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
• \(\mathsf{RT}_{2}^{2}\) does not imply \(\mathsf{WKL}_{0}\)
• Stable Ramsey's theorem and measure
• Ramsey's theorem for singletons and strong computable reducibility

Cites work

• \(\mathsf{RT}_{2}^{2}\) does not imply \(\mathsf{WKL}_{0}\)
• A _2⁰ set with no infinite low subset in either it or its complement
• A cohesive set which is not high
• Cohesive avoidance and strong reductions
• Cohesive sets and rainbows
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Cone avoiding closed sets
• Controlling iterated jumps of solutions to combinatorial problems
• Math in 100 key breakthroughs
• On notions of computability-theoretic reduction between Π21 principles
• On the role of the collection principle for \(\Sigma ^0_2\)-formulas in second-order reverse mathematics
• On the strength of Ramsey's theorem
• On the strength of Ramsey's theorem for pairs
• On uniform relationships between combinatorial problems
• Partial realizations of Hilbert's program
• Partition Theorems and Computability Theory
• Pigeons do not jump high
• Ramsey's theorem and recursion theory
• Some results concerning the \(\mathsf{SRT}_2^2\) vs. \(\mathsf{COH}\) problem
• Strong reductions between combinatorial principles
• Subsystems of second order arithmetic
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
• The weakness of being cohesive, thin or free in reverse mathematics
• ∏ 0 1 Classes and Degrees of Theories

Cited in

(12)

• Separating weak -change and -change genericity
• \(\mathsf{RT}_{2}^{2}\) does not imply \(\mathsf{WKL}_{0}\)
• The strength of the rainbow Ramsey Theorem
• An inside/outside Ramsey theorem and recursion theory
• Reduction games, provability and compactness
• SRT22 does not imply RT22 in omega-models
• The Ginsburg-Sands theorem and computability theory
• Erdős-Moser and I _2
• ^0_4 conservation of Ramsey's theorem for pairs
• Indivisibility and uniform computational strength
• Conservation of Ramsey's theorem for pairs and well-foundedness
• The metamathematics of separated determinacy

This page was built for publication: \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048618)