Article contents
Rainbow Ramsey Theorem for Triples is Strictly Weaker than the Arithmetical Comprehension Axiom
Published online by Cambridge University Press: 12 March 2014
Abstract
We prove that RCA0 + RRT ⊬ ACA0 where RRT
is the Rainbow Ramsey Theorem for 2-bounded colorings of triples. This reverse mathematical result is based on a cone avoidance theorem, that every 2-bounded coloring of pairs admits a cone-avoiding infinite rainbow, regardless of the complexity of the given coloring. We also apply the proof of the cone avoidance theorem to the question whether RCA0 + RRT
⊦ ACA0 and obtain some partial answer.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2013
References
REFERENCES
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20160825053048221-0364:S0022481200126623_inline3.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20160825053048221-0364:S0022481200126623_inline3.gif?pub-status=live)
- 6
- Cited by