Author:
OLIVA PAULO,POWELL THOMAS
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.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference23 articles.
1. Escardó M. H. and Oliva P. (2012) Computing Nash equilibria of unbounded games. In: Proceedings of the Turing 100 Conference. Turing 100, Manchester.
2. Oliva P. and Powell T. (2012) A game-theoretic computational interpretation of proofs in classical analysis. (Preprint available at arxiv.org/abs/1204.5244.)
3. Computational Interpretations of Analysis via Products of Selection Functions
4. Subsystems of Second Order Arithmetic
5. Ramsey interpreted: a parametric version of Ramsey’s theorem
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献