A constructive interpretation of Ramsey's theorem via the product of selection functions

Abstract

We use Gödel's dialectica interpretation to produce a computational version of the wellknown proof of Ramsey's theorem by Erdős and Rado. Our proof makes use of the product of selection functions, which forms an intuitive alternative to Spector's bar recursion when interpreting proofs in analysis. This case study is another instance of the application of proof theoretic techniques in mathematics.

An analysis of the Podelski–Rybalchenko termination theorem via bar recursion

“…The basic ideas behind the proof are those presented in [6] for the classical Ramsey theorem. Our proof of Theorem 1.6 requires the Transitive Ramsey Theorem for pairs, a corollary of the Ramsey Theorem for pairs which can be stated as follows: The structure of the proof is the following.…”

An intuitionistic version of Ramsey's Theorem and its use in Program Termination

“…Bellin in [4] applied the no-counterexample interpretation to Ramsey's Theorem, while Oliva and Powell in [22], by starting from a formalization of Erdős and Rado's proof of Ramsey's Theorem given by Kreuzer and Kohlenbach in [18], used the Dialectica interpretation. They approximated the homogeneous set by a set which may stand any test checking whether some initial segment is homogeneous.…”

Applying Gödel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma

“…Our aim in the next section is to pick suitable counterexample functions such that (16) implies ¬θ (p n , Φ p,f ) for some n ≤ Ω p,f , then by induction over (15) we have…”