On the Ramseyan factorization theorem

On the Ramseyan factorization theorem
复制标题

关于拉姆齐因式分解定理

DOI:
10.1007/978-3-319-08019-2_33
复制
发表时间:
2014
期刊:
Lecture Notes in Computer Science
影响因子:
--
通讯作者:
T.Yamazaki and K.Yokoyama
T.Yamazaki and K.Yokoyama
中科院分区:
--
文献类型:
--
作者:
S.Murakami;T.Yamazaki and K.Yokoyama

文献摘要

相似文献

在逆数学的背景下,我们研究了Ramseyan分解定理()的强度,它是自动机理论中使用的Ramsey型定理。我们证明了这与RCAO上的k≥ 2,k∈ω等价。我们还考虑了Ramseyan分解定理的一个弱形式,并证明了它介于ADS和CAC之间。
We study, in the context of reverse mathematics, the strength of Ramseyan factorization theorem (), a Ramsey-type theorem used in automata theory. We prove thatis equivalent tofor alls,k≥ 2,k∈ωoverRCAo. We also consider a weak version of Ramseyan factorization theorem and prove that it is in between ADS and CAC.