Journal of Symbolic Logic

The strength of the rainbow Ramsey Theorem

Barbara F. Csima and Joseph R. Mileti

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


The Rainbow Ramsey Theorem is essentially an “anti-Ramsey" theorem which states that certain types of colorings must be injective on a large subset (rather than constant on a large subset). Surprisingly, this version follows easily from Ramsey's Theorem, even in the weak system RCA0 of reverse mathematics. We answer the question of the converse implication for pairs, showing that the Rainbow Ramsey Theorem for pairs is in fact strictly weaker than Ramsey's Theorem for pairs over RCA0. The separation involves techniques from the theory of randomness by showing that every 2-random bounds an ω-model of the Rainbow Ramsey Theorem for pairs. These results also provide as a corollary a new proof of Martin's theorem that the hyperimmune degrees have measure one.

Article information

J. Symbolic Logic, Volume 74, Issue 4 (2009), 1310-1324.

First available in Project Euclid: 5 October 2009

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Csima, Barbara F.; Mileti, Joseph R. The strength of the rainbow Ramsey Theorem. J. Symbolic Logic 74 (2009), no. 4, 1310--1324. doi:10.2178/jsl/1254748693.

Export citation