Games with sequential backtracking and complete game semantics for subclassical logics

DOI10.1007/978-3-642-38946-7_7zbMATH Open1381.68029OpenAlexW2281731248MaRDI QIDQ5300894FDOQ5300894

Authors: Stefano Berardi, Makoto Tatsuta 

Publication date: 28 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38946-7_7

Recommendations

• Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves
• scientific article; zbMATH DE number 6930552
• Games with 1-backtracking
• A game semantics for system P
• Learning based realizability for HA + EM1 and 1-backtracking games: soundness and completeness

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) First-order arithmetic and fragments (03F30) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Cited In (5)

• Title not available (Why is that?)
• Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves
• Reasoning About Substructures and Games
• A game semantics for system P
• Backtracking games and inflationary fixed points

This page was built for publication: Games with sequential backtracking and complete game semantics for subclassical logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300894)