HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK?
HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK?
复制标题
如果无穷大可以很弱,那么拉姆齐定理有多强?
DOI:
10.1017/jsl.2022.46
复制
发表时间:
2022
期刊:
影响因子:
--
通讯作者:
YOKOYAMA KEITA
中科院分区:
文献类型:
--
作者:
KOLODZIEJCZYK LESZEK ALEKSANDER;KOWALIK KATARZYNA W.;YOKOYAMA KEITA
We study the first-order consequences of Ramsey’s Theorem for k-colourings of n-tuples, for fixed , over the relatively weak second-order arithmetic theory . Using the Chong–Mourad coding lemma, we show that in a model of that does not satisfy induction, is equivalent to its relativization to any proper -definable cut, so its truth value remains unchanged in all extensions of the model with the same first-order universe. We give a complete axiomatization of the first-order consequences of for . We show that they form a non-finitely axiomatizable subtheory of whose fragment coincides with and whose fragment for lies between and . We also give a complete axiomatization of the first-order consequences of . In general, we show that the first-order consequences of form a subtheory of whose fragment coincides with and whose fragment is strictly weaker than but not contained in . Additionally, we consider a principle - which is defined like but with both the -colourings and the solutions allowed to be -sets rather than just sets. We show that the behaviour of - over is in many ways analogous to that of over , and that - is - but not -conservative over . However, the statement we use to witness failure of -conservativity is not provable in .
登录
查看更多内容
影响因子:
0.6
作者:
R. Kaye
通讯作者:
R. Kaye
DOI:
10.1112/s002461079600470x
发表时间:
1997
期刊:
Journal of the London Mathematical Society
影响因子:
--
作者:
R. Kaye
通讯作者:
R. Kaye
DOI:
10.1016/0168-0072(90)90021-s
发表时间:
1990
期刊:
Ann. Pure Appl. Log.
影响因子:
--
作者:
C. Chong;K. Mourad
通讯作者:
K. Mourad
DOI:
--
发表时间:
2014
期刊:
--
影响因子:
--
作者:
Ian Haken
通讯作者:
Ian Haken
DOI:
--
发表时间:
1998
期刊:
影响因子:
--
作者:
P. Pudlák
通讯作者:
P. Pudlák