The strength of the rainbow Ramsey Theorem
From MaRDI portal
Publication:3655258
Recommendations
- On the strength of Ramsey's theorem for pairs
- Cohesive sets and rainbows
- Rainbow Ramsey theorem for triples is strictly weaker than the arithmetical comprehension axiom
- Stable Ramsey's theorem and measure
- \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Degrees bounding principles and universal instances in reverse mathematics
- Cappable CEA sets and Ramsey's theorem
- The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
- Ramsey's theorem for singletons and strong computable reducibility
Cites work
- scientific article; zbMATH DE number 1955470 (Why is no real title available?)
- Algorithmic randomness and complexity.
- Ars combinatoria
- Calibrating Randomness
- Class groups of integral group rings
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Computability and randomness
- On the strength of Ramsey's theorem
- On the strength of Ramsey's theorem for pairs
- Polychromatic cliques
- The canonical Ramsey theorem and computability theory
Cited in
(27)- On the strength of Ramsey's theorem for pairs
- Some logically weak Ramseyan theorems
- Comparisons of polychromatic and monochromatic Ramsey theory
- Rainbow Ramsey simple structures
- On uniform relationships between combinatorial problems
- Controlling iterated jumps of solutions to combinatorial problems
- Coloring the rationals in reverse mathematics
- Partial orders and immunity in reverse mathematics
- Randomness notions and reverse mathematics
- The strength of Ramsey's theorem for coloring relatively large sets
- Combinatorial principles between \(\text{RRT}_2^2\) and \(\text{RT}_2^2\)
- The weakness of the pigeonhole principle under hyperarithmetical reductions
- Rainbow Ramsey theorem for triples is strictly weaker than the arithmetical comprehension axiom
- Degrees bounding principles and universal instances in reverse mathematics
- Stable Ramsey's theorem and measure
- A rainbow Ramsey analogue of Rado's theorem
- Iterative forcing and hyperimmunity in reverse mathematics
- Ramsey-like theorems and moduli of computation
- Pigeons do not jump high
- Random reals, the rainbow Ramsey theorem, and arithmetic conservation
- On the Ramseyan factorization theorem
- Open questions about Ramsey-type statements in reverse mathematics
- Some remarks on uncountable rainbow Ramsey theory
- Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
- Cohesive sets and rainbows
- Nonstandard models in recursion theory and reverse mathematics
- scientific article; zbMATH DE number 5014483 (Why is no real title available?)
This page was built for publication: The strength of the rainbow Ramsey Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655258)
