Paper Info
Title
Games with Sequential Backtracking and Complete Game Semantics for Subclassical Logics.
Abstract
This paper introduces a game semantics for Arithmetic with various sub-classical logics that have implication as a primitive connective. This semantics clarifies the infinitary sequent calculus that the authors proposed for intuitionistic arithmetic with Excluded Middle for Sigma-0-1-formulas, a formal system motivated by proof mining and by the study of monotonic learning, for which no game semantics is known. This paper proposes games with Sequential Backtracking, and proves that they provide a sound and complete semantics for the logical system and other various subclassical logics. In order for that, this paper also defines a one-sided version of the logical system, whose proofs have a tree isomorphism with respect to the winning strategies of the game semantics.
Year
DOI
Venue
2013
10.1007/978-3-642-38946-7_7
Lecture Notes in Computer Science
DocType
Volume
ISSN
Conference
7941
0302-9743
Citations 
PageRank 
References 
0
0.34
14
Authors
2
Name
Order
Citations
PageRank
Stefano Berardi137351.58
Makoto Tatsuta211122.36