Cohesive sets and rainbows (Q386619)

For natural numbers \(n\) and \(k\), the rainbow Ramsey theorem (RRT\(^n_k\)) states that if \(f:[\mathbb N ]^n\to \mathbb N\) satisfies \(|f^{-1}(c)|\leq k\) for each \(c\), then there is an infinite set \(R\) such that \(f\) is injective on \([R ]^n\). \(R\) is called a rainbow for \(f\). The central results of this paper analyze the strength of RRT\(^3_2\) in the framework of reverse mathematics, showing that RCA\(_0\)+RRT\(^3_2\) implies neither WKL\(_0\) nor RRT\(^4_2\). Computability-theoretic results on cohesive sets are used in the proofs. The results here sharpen the main result of the author's earlier related paper [J. Symb. Log. 78, No. 3, 824--836 (2013; Zbl 1300.03013)].