TY - GEN

T1 - On the Ramseyan factorization theorem

AU - Murakami, Shota

AU - Yamazaki, Takeshi

AU - Yokoyama, Keita

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84903594978&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84903594978&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-08019-2_33

DO - 10.1007/978-3-319-08019-2_33

M3 - Conference contribution

AN - SCOPUS:84903594978

SN - 9783319080185

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 324

EP - 332

BT - Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Proceedings

PB - Springer-Verlag

T2 - 10th Conference on Computability in Europe, CiE 2014

Y2 - 23 June 2014 through 27 June 2014

ER -