Skip to main content
    • Aa
    • Aa

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


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.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

J. Avigad (2009) The metamathematics of ergodic theory. Annals of Pure and Applied Logic 157 6476.

J. Avigad and S. Feferman (1998) Gödel's functional (‘Dialectica’) interpretation. In: S. R. Buss (ed.) Handbook of Proof Theory. Studies in Logic and the Foundations of Mathematics volume 137, North Holland, Amsterdam 337405.

G. Bellin (1990) Ramsey interpreted: A parametric version of Ramsey's theorem. In: Logic and Computation (Pittsburgh, PA, 1987), volume 106, American Mathematical Society, Providence, Rhode Island, U.S.A 1737.

T. Coquand (1994a) An analysis of Ramsey's theorem. Information and Computation 110 (2) 297304.

M. H. Escardó and P. Oliva (2010a) Computational interpretations of analysis via products of selection functions. In: F. Ferreira , B. Lowe , E. Mayordomo and L. M. Gomes (eds.) Computability in Europe 2010. Springer Lecture Notes in Computer Science 6158, 141150.

M. H. Escardó and P. Oliva (2011) Sequential games and optimal strategies. Royal Society Proceedings A 467 15191545.

K. Gödel (1958) Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica 12 280287.

G. Kreisel (1951) On the interpretation of non-finitist proofs, part I. Journal of Symbolic Logic 16 241267.

S. G. Simpson (1999) Subsystems of Second Order Arithmetic, Perspectives in Mathematical Logic, Springer, Berlin.

C. Spector (1962) Provably recursive functionals of analysis: A consistency proof of analysis by an extension of principles in current intuitionistic mathematics. In: F. D. E. Dekker (ed.) Recursive Function Theory: Proceedings Symposia in Pure Mathematics, volume 5, American Mathematical Society, Providence, Rhode Island 127.

T. Tao (2008) Structure and Randomness: Pages from Year one of a Mathematical Blog, American Mathematical Society.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 15 *
Loading metrics...

Abstract views

Total abstract views: 123 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 25th September 2017. This data will be updated every 24 hours.