The strength of the rainbow Ramsey Theorem
DOI10.2178/JSL/1254748693zbMATH Open1188.03044OpenAlexW2157945276MaRDI QIDQ3655258FDOQ3655258
Authors: Joseph R. Mileti, Barbara Csima 
Publication date: 7 January 2010
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1254748693
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
Algorithmic randomness and dimension (03D32) Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35)
Cites Work
- Algorithmic randomness and complexity.
- Computability and randomness
- Title not available (Why is that?)
- On the strength of Ramsey's theorem for pairs
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Calibrating Randomness
- On the strength of Ramsey's theorem
- Polychromatic cliques
- The canonical Ramsey theorem and computability theory
- Ars combinatoria
- Class groups of integral group rings
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
- A rainbow Ramsey analogue of Rado's theorem
- Iterative forcing and hyperimmunity in reverse mathematics
- Stable Ramsey's theorem and measure
- 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
- Nonstandard models in recursion theory and reverse mathematics
- Cohesive sets and rainbows
- Title not available (Why is that?)
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)
