How strong is Ramsey's theorem if infinity can be weak?
Leszek Aleksander Ko{\l}odziejczyk, Katarzyna W. Kowalik, Keita, Yokoyama

TL;DR
This paper investigates the logical strength of Ramsey's Theorem for various parameters within weak second-order arithmetic, revealing its equivalences, axiomatizations, and the impact of allowing $ riangle^0_2$-sets on its strength.
Contribution
It provides a detailed analysis of the first-order consequences of Ramsey's Theorem in weak arithmetic theories and introduces a $ riangle^0_2$-variant, expanding understanding of its logical strength.
Findings
RT$^n_k$ is equivalent to its relativization in certain models.
First-order consequences form a non-finitely axiomatizable subtheory of PA.
$ riangle^0_2$-RT$^2_2$ behaves similarly to RT$^2_2$ over certain base theories.
Abstract
We study the first-order consequences of Ramsey's Theorem for -colourings of -tuples, for fixed , over the relatively weak second-order arithmetic theory . Using the Chong-Mourad coding lemma, we show that in a model of , is equivalent to its own 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 an axiomatization of the first-order consequences of for . We show that they form a non-finitely axiomatizable subtheory of PA whose fragment is and whose fragment for lies between and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Limits and Structures in Graph Theory
