Abstract
We use Gödel's dialectica interpretation to produce a computational version of the well-known 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.
Original language | English |
---|---|
Pages (from-to) | 1755-1778 |
Journal | Mathematical Structures in Computer Science |
Volume | 25 |
Issue number | 8 |
Publication status | Published - 2015 |