GAME SEMANTICS AND THE GEOMETRY OF BACKTRACKING: A NEW COMPLEXITY ANALYSIS OF INTERACTION
From MaRDI portal
Publication:4977225
DOI10.1017/jsl.2016.48zbMath1401.03100arXiv1511.06260OpenAlexW2963005210MaRDI QIDQ4977225
Publication date: 3 August 2017
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.06260
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Cut-elimination and normal-form theorems (03F05) Complexity of proofs (03F20)
Related Items
Cites Work
- On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem
- Games with 1-backtracking
- Classical proof forestry
- Toward the interpretation of non-constructive reasoning as non-monotonic learning
- A compact representation of proofs
- Mind change complexity of learning logic programs
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Learning based realizability for HA + EM1 and 1-backtracking games: soundness and completeness
- Exact bounds for lengths of reductions in typed λ-calculus
- Interactive Learning-Based Realizability for Heyting Arithmetic with EM1
- Bounding linear head reduction and visible interaction through skeletons
- The duality of computation
- Estimation of the Length of Interactions in Arena Game Semantics
- A semantics of evidence for classical arithmetic
- Constructive forcing, CPS translations and witness extraction in Interactive realizability
- A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis
- Knowledge Spaces and the Completeness of Learning Strategies
- Language identification in the limit
- On weak completeness of intuitionistic predicate logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
