Rainbow Ramsey theorem for triples is strictly weaker than the arithmetical comprehension axiom (Q2869903)

The rainbow Ramsey theorem addresses colorings of \(n\)-tuples. A coloring \(f: [\mathbb N ]^n \to \mathbb N\) is \textit{\(k\)-bounded} if \(|f^{-1}(c)|\leq k\) for every \(c \in \mathbb N\). A set \(R \subseteq \mathbb N\) is a \textit{rainbow} for \(f\) if \(f\) is injective on \([R]^n\). For natural numbers \(n\) and \(k\), the rainbow Ramsey theorem states: (RRT\(^n_k\)) If \(f: [\mathbb N ]^n \to \mathbb N\) is \(k\)-bounded, then there is an infinite rainbow for \(f\). Working in the framework of reverse mathematics, the author shows that RCA\(_0\)+RRT\(^3_2\not\vdash\)ACA\(_0\) via an adaptation of cone-avoidance arguments like those used to analyze the strength of Ramsey's theorem for pairs. This result is sharpened in the author's article [Ann. Pure Appl. Logic 165, No. 2, 389--408 (2014; Zbl 1300.03012)]. For other results on the strength of the rainbow Ramsey theorem, see the work of \textit{B. F. Csima} and \textit{J. R. Mileti} [J. Symb. Log. 74, No. 4, 1310--1324 (2009; Zbl 1188.03044)].