A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis

Paulo Oliva () and Thomas Powell
Additional contact information
Paulo Oliva: Queen Mary, University of London, School of Electronic Engineering and Computer Science
Thomas Powell: University of Innsbruck, ICT Gebäude

A chapter in Gentzen's Centenary, 2015, pp 501-531 from Springer

Abstract: Abstract It has been shown by Escardó and the first author that a functional interpretation of proofs in analysis can be given by the product of selection functions, a mode of recursion that has an intuitive reading in terms of the computation of optimal strategies in sequential games. We argue that this result has genuine practical value by interpreting some well-known theorems of mathematics and demonstrating that the product gives these theorems a natural computational interpretation that can be clearly understood in game theoretic terms.

Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-10103-3_18

Ordering information: This item can be ordered from
http://www.springer.com/9783319101033

DOI: 10.1007/978-3-319-10103-3_18

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().