How strong is Ramsey's theorem if infinity can be weak?
Abstract
We study the first-order consequences of Ramsey's Theorem for k-colourings of n-tuples, for fixed n, k 2, over the relatively weak second-order arithmetic theory RCA*0. Using the Chong-Mourad coding lemma, we show that in a model of RCA*0 + I01, RTnk is equivalent to its own relativization to any proper 01-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 RCA*0 + RTnk for n 3. We show that they form a non-finitely axiomatizable subtheory of PA whose 3 fragment is B1 + and whose +3 fragment for 1 lies between I ⇒ B+1 and B+1. We also consider the first-order consequences of RCA*0 + RT2k. We show that they form a subtheory of I2 whose 3 fragment is B1 + and whose 4 fragment is strictly weaker than B2 but not contained in I1. Additionally, we consider a principle 02-RT22, defined like RT22 but with both the 2-colourings and the solutions allowed to be 02-sets. We show that the behaviour of 02-RT22 over RCA0 + B02 is similar to that of RT22 over RCA*0, and that RCA0 + B02 + 02-RT22 is 4- but not 5-conservative over B2. However, the statement we use to witness lack of 5-conservativity is not provable in RCA0 +RT22.