A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis

DOI10.1007/978-3-319-10103-3_18zbMath1378.03046arXiv1204.5244OpenAlexW2268047087MaRDI QIDQ5361260

No author found.

Publication date: 27 September 2017

Published in: Gentzen's Centenary (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.5244

zbMATH Keywords

sequential gamesproduct of selection functionsfunctional interpretation of proofs

Mathematics Subject Classification ID

Applications of game theory (91A80) Functionals in proof theory (03F10) Relative consistency and interpretations (03F25) Higher-type and set recursion theory (03D65)

Related Items (3)

Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language ⋮ Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs ⋮ GAME SEMANTICS AND THE GEOMETRY OF BACKTRACKING: A NEW COMPLEXITY ANALYSIS OF INTERACTION

This page was built for publication: A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis