On the Ramseyan factorization theorem

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

8 Citations (Scopus)


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
Number of pages9
ISBN (Print)9783319080185
Publication statusPublished - 2014
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


Other10th Conference on Computability in Europe, CiE 2014

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


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

Cite this