Abstract
We study, in the context of reverse mathematics, the strength of Ramseyan factorization theorem (RFks), a Ramsey-type theorem used in automata theory. We prove that RFks is equivalent to RT22 for all s,k ≥ 2, k ∈ ω over RCA 0. We also consider a weak version of Ramseyan factorization theorem and prove that it is in between ADS and CAC. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Murakami, S., Yamazaki, T., & Yokoyama, K. (2014). On the Ramseyan factorization theorem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8493 LNCS, pp. 324–332). Springer Verlag. https://doi.org/10.1007/978-3-319-08019-2_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
