This paper addresses the strength of Ramsey's theorem for pairs () over a weak base theory from the perspective of 'proof mining'. Let denote Ramsey's theorem for pairs where the coloring is given by an explicit term involving only numeric variables. We add this principle to a weak base theory that includes weak König's Lemma and a substantial amount of -induction (enough to prove the totality of all primitive recursive functions but not of all primitive recursive functionals). In the resulting theory we show the extractability of primitive recursive programs and uniform bounds from proofs of -theorems.
There are two components of this work. The first component is a general proof-theoretic result, due to the second author, that establishes conservation results for restricted principles of choice and comprehension over primitive recursive arithmetic PRA as well as a method for the extraction of primitive recursive bounds from proofs based on such principles. The second component is the main novelty of the paper: it is shown that a proof of Ramsey's theorem due to Erdős and Rado can be formalized using these restricted principles.
So from the perspective of proof unwinding the computational content of concrete proofs based on the computational complexity will, in most practical cases, not go beyond primitive recursive complexity. This even is the case when the theorem to be proved has function parameters f and the proof uses instances of that are primitive recursive in f.
"Ramsey's Theorem for Pairs and Provably Recursive Functions." Notre Dame J. Formal Logic 50 (4) 427 - 444, 2009. https://doi.org/10.1215/00294527-2009-019