A computable analysis of variable words theorems

Abstract : The Carlson-Simpson lemma is a combinatorial statement occurring in the proof of the Dual Ramsey theorem. Formulated in terms of variable words, it informally asserts that given any finite coloring of the strings, there is an infinite sequence with infinitely many variables such that for every valuation, some specific set of initial segments is homogeneous. Friedman, Simpson, and Montalban asked about its reverse mathematical strength. We study the computability-theoretic properties and the reverse mathematics of this statement, and relate it to the finite union theorem. In particular, we prove the Ordered Variable word for binary strings in ACA 0 .
Document type :
Journal articles
Complete list of metadatas

Contributor : Ludovic Patey <>
Submitted on : Tuesday, October 9, 2018 - 3:14:47 PM
Last modification on : Friday, May 10, 2019 - 2:46:35 PM
Long-term archiving on : Thursday, January 10, 2019 - 12:27:11 PM


Files produced by the author(s)



Lu Liu, Benoit Monin, Ludovic Patey. A computable analysis of variable words theorems. Proceedings of the American Mathematical Society, American Mathematical Society, In press, ⟨10.1090/proc/14269⟩. ⟨hal-01888789⟩



Record views


Files downloads