A game-theoretic computational interpretation of proofs in classical analysis

Paulo Oliva, Thomas Powell

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationGentzen's Centenary
Subtitle of host publicationThe Quest for Consistency
EditorsReinhard Kahle, Michael Rathjen
PublisherSpringer International Publishing
Chapter18
Pages501-531
ISBN (Electronic)978-3-319-10103-3
ISBN (Print)978-3-319-10102-6
DOIs
Publication statusPublished - 2015

Fingerprint Dive into the research topics of 'A game-theoretic computational interpretation of proofs in classical analysis'. Together they form a unique fingerprint.

Cite this