On the Ramseyan factorization theorem

Shota Murakami, Takeshi Yamazaki, Keita Yokoyama

研究成果: Conference contribution

8 被引用数 (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.

本文言語English
ホスト出版物のタイトルLanguage, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Proceedings
出版社Springer Verlag
ページ324-332
ページ数9
ISBN(印刷版)9783319080185
DOI
出版ステータスPublished - 2014
イベント10th Conference on Computability in Europe, CiE 2014 - Budapest, Hungary
継続期間: 2014 6 232014 6 27

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
8493 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)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)

フィンガープリント 「On the Ramseyan factorization theorem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル