Games with 1-backtracking

DOI10.1016/J.APAL.2010.03.002zbMath1241.03006OpenAlexW2031660859MaRDI QIDQ636360

Thierry Coquand, Susumu Hayashi, Stefano Berardi

Publication date: 26 August 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2010.03.002

zbMATH Keywords

computabilityclassical logicgame semanticsbacktrackinglearning in the limitconstructive content of classical theoremslimit computable mathematicsrecursive degree

Mathematics Subject Classification ID

Games involving graphs (91A43) Constructive and recursive analysis (03F60) Undecidability and degrees of sets of sentences (03D35) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Related Items (6)

Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Fluctuations, effective learnability and metastability in analysis ⋮ Positive Arithmetic Without Exchange Is a Subclassical Logic ⋮ Toward the interpretation of non-constructive reasoning as non-monotonic learning ⋮ A New Translation for Semi-classical Theories — Backtracking without CPS ⋮ GAME SEMANTICS AND THE GEOMETRY OF BACKTRACKING: A NEW COMPLEXITY ANALYSIS OF INTERACTION

Cites Work

• Unnamed Item
• Unnamed Item
• Mathematics based on incremental learning -- excluded middle and inductive inference
• Toward the interpretation of non-constructive reasoning as non-monotonic learning
• Classical recursion theory. Vol. II
• On full abstraction for PCF: I, II and III
• A sequent calculus for limit computable mathematics
• Positive Arithmetic Without Exchange Is a Subclassical Logic
• A semantics of evidence for classical arithmetic

This page was built for publication: Games with 1-backtracking