A game-theoretic computational interpretation of proofs in classical analysis
From MaRDI portal
Abstract: It has been shown that a functional interpretation of proofs in mathematical 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.
Recommendations
- Sequential games and optimal strategies
- A generalization of Nash's theorem with higher-order functionals
- A constructive interpretation of Ramsey's theorem via the product of selection functions
- Computational Interpretations of Classical Linear Logic
- Functional interpretations of linear and intuitionistic logic
Cited in
(8)- A generalization of Nash's theorem with higher-order functionals
- Sequential games and optimal strategies
- Computational interpretations of classical reasoning: from the epsilon calculus to stateful programs
- Spielquantorinterpretation unstetiger Funktionale der höheren Analysis
- scientific article; zbMATH DE number 1231521 (Why is no real title available?)
- Game semantics and the geometry of backtracking: a new complexity analysis of interaction
- A constructive interpretation of Ramsey's theorem via the product of selection functions
- Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
This page was built for publication: A game-theoretic computational interpretation of proofs in classical analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361260)
