{"paper":{"title":"Somewhere over the rainbow Ramsey theorem for pairs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Ludovic Patey","submitted_at":"2015-01-29T12:03:02Z","abstract_excerpt":"The rainbow Ramsey theorem states that every coloring of tuples where each color is used a bounded number of times has an infinite subdomain on which no color appears twice. The restriction of the statement to colorings over pairs (RRT22) admits several characterizations: it is equivalent to finding an infinite subset of a 2-random, to diagonalizing against Turing machines with the halting set as oracle... In this paper we study principles that are closely related to the rainbow Ramsey theorem, the Erd\\H{o}s Moser theorem and the thin set theorem within the framework of reverse mathematics. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07424","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}