The proof-theoretic strength of a theory is measured by the $\mathsf{\Pi}_{1}^{1}$-ordinal of the theory (indeed, there are other ordinal analyses, like the $\Pi_{2}^{0}$-ordinal of the theory).
Consider the following statements:
Finite Ramsey Theorem ($\mathrm{FRT}$): For any $r,k,p\in\mathbb{N}$, there exists $N\in\mathbb{N}$ such that for any set $S$ of cardinality $N$ and any function $c:[S]^{p}\rightarrow [r]$ there exists a subset $H\subseteq S$ of cardinality $k$ such that $c|_{[H]^{p}}$ is constant.
By $[r]$ we mean the set $\{1,\ldots r\}$, and the function $c$ is often called an $r$-coloring of the $p$-element subsets of $S$. The subset $H$ is called a homogeneous $k$-subset of $S$.
What is the proof-theoretic strength of $\mathrm{FRT}$? My understanding is that it should not be more than $\omega^{\omega}$ because $\mathsf{RCA}_{0}+\mathsf{IΣ}_{1}$ proves $\mathrm{FRT}$ since we are essentially applying induction to the formula: "there exists an $N$ such that every $r$-coloring of the $p$-element subsets of $\{1,\ldots,N\}$ has a homogeneous $k$-subset". But $\mathsf{RCA}_{0}+\mathsf{IΣ}_{1}$ seems more than we really need, and it may very well be that the proof-theoretic strength is $\omega^{n}$ for some low $n\ge 1$.
Infinite Ramsey Theorem ($\mathrm{IRT}$): For any $r,p\in\mathbb{N}$, and for any function $c:[\mathbb{N}]^{p}\rightarrow [r]$, there exists an infinite subset $H\subseteq \mathbb{N}$ such that $c|_{[H]^{p}}$ is constant.
Let $\mathrm{IRT}(p)$ denote the instance of $\mathrm{IRT}$ for exponent $p$. That is, $\mathrm{IRT}$ is simply the statement $\forall p\,\,\mathrm{IRT}(p)$.
First, we consider the case of $A$ countable:
- Over $\mathsf{RCA}_{0}$, $\mathsf{ACA}_{0}$ proves $\mathrm{IRT}(P)$, $p\geq 0$ (Lemma III.7.4, p.123 of 1). Therefore, the proof-theoretic strength of $\mathrm{IRT}(p)$, $p\ge 0$ is at most $\varepsilon_{0}$. Moreover, Theorem III.7.6, p.124 of 1 shows that over $\mathsf{RCA}_{0}$, $\mathsf{ACA}_{0}$ is equivalent to $\mathrm{IRT}(p)$, $p\ge 3$. Therefore, the proof-theoretic ordinal of $\mathrm{IRT}(p)$, $p\geq 3$ is indeed $\varepsilon_{0}$. The case $\mathrm{IRT}(0)$ is trivial. Does the proof-theoretic strength of $\mathrm{IRT}(1)$ (i.e. the infinite pigeonhole principle) equal $\omega^{\omega}$? What is the proof-theoretic strength of $\mathrm{IRT}(2)$?
- Remark III.7.7, p.124 in 1 indicates that the statement $\forall p\,\,\mathrm{IRT}(p)$ is provable from $\mathsf{ACA}_{0}$ plus $\mathsf{\Pi}_{2}^{1}$-induction over $\mathsf{RCA}_{0}$. From this I gather that the proof-theoretic strength of $\mathrm{IRT}$ could be $\varepsilon_{\alpha}$ for some ordinal $\alpha$ (possibly $\alpha=\omega$?) But I am not sure. What is the proof-theoretic strength of IRT?
Second, we consider $A$ arbitrary infinite: Then we must consider $\mathrm{IRT}$ as a statement of $\mathsf{ZFC}$, for it has been shown in [2] that $\mathrm{IRT}$ is not a theorem of $\mathsf{ZF}$ and that some form of the Axiom of Choice is necessary to prove it. What is the proof-theoretic strength of $\mathrm{IRT}$ in this context?
Finally, if we modify $\mathrm{IRT}$ above by exchanging the sentence "Let $A$ be an infinite set" with "For any infinite set $A$"- does this change any of the results discussed in the first case above (i.e. when infinite means countably infinite)? What about the second case (i.e. when infinite means arbitray infinite)
1 Simpson, S. S., Subsystems of Second Order Arithmetic 2nd. ed. Cambridge University Press. Cambridge-New York (2009)
[2] Kleinberg, E. M., The independence of Ramsey's theorem. The journal of symbolic logic, vol. 34 (1969), pp. 205–206.