On the Ramseyan factorization theorem

Shota Murakami, Takeshi Yamazaki, Keita Yokoyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLanguage, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Proceedings
PublisherSpringer-Verlag
Pages324-332
Number of pages9
ISBN (Print)9783319080185
DOIs
Publication statusPublished - 2014 Jan 1
Event10th Conference on Computability in Europe, CiE 2014 - Budapest, Hungary
Duration: 2014 Jun 232014 Jun 27

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8493 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th Conference on Computability in Europe, CiE 2014
CountryHungary
CityBudapest
Period14/6/2314/6/27

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the Ramseyan factorization theorem'. Together they form a unique fingerprint.

  • Cite this

    Murakami, S., Yamazaki, T., & Yokoyama, K. (2014). On the Ramseyan factorization theorem. In Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Proceedings (pp. 324-332). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8493 LNCS). Springer-Verlag. https://doi.org/10.1007/978-3-319-08019-2_33