The intuitionistic fragment of computability logic at the propositional level

Abstract This paper presents a soundness and completeness proof for propositional intuitionistic calculus with respect to the semantics of computability logic. The latter interprets formulas as interactive computational problems, formalized as games between a machine and its environment. Intuitionistic implication is understood as algorithmic reduction in the weakest possible — and hence most natural — sense, disjunction and conjunction as deterministic-choice combinations of problems (disjunction = machine’s choice, conjunction = environment’s choice), and “absurd” as a computational problem of universal strength.

[1]  Giorgi Japaridze.  From truth to computability I , 2006, Theor. Comput. Sci..

[2]  Saul A. Kripke,et al.  Semantical Analysis of Intuitionistic Logic I , 1965 .

[3]  Giorgi Japaridze,et al.  Propositional computability logic I , 2004, TOCL.

[4]  Von Kurt Gödel,et al.  ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES , 1958 .

[5]  Andreas Blass,et al.  Degrees of indeterminacy of games , 1972 .

[6]  Giorgi Japaridze,et al.  Introduction to Cirquent Calculus and Abstract Resource Semantics , 2005, J. Log. Comput..

[7]  Giorgi Japaridze,et al.  Propositional computability logic II , 2004, TOCL.

[8]  Andreas Blass,et al.  A Game Semantics for Linear Logic , 1992, Ann. Pure Appl. Log..

[9]  A. Kolmogoroff.  Zur Deutung der intuitionistischen Logik , 1932 .

[10]  Giorgi Japaridze,et al.  Intuitionistic computability logic , 2004, Acta Cybern..

[11]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[12]  Sergei N. Artëmov.  Explicit provability and constructive semantics , 2001, Bull. Symb. Log..

[13]  Giorgi Japaridze,et al.  Introduction to computability logic , 2003, Ann. Pure Appl. Log..

[14]  Giorgi Japaridze,et al.  The logic of interactive turing reduction , 2005, Journal of Symbolic Logic.

[15]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[16]  Giorgi Japaridze.  Computability Logic: a formal theory of interaction , 2004, ArXiv.

[17]  Giorgi Japaridze,et al.  From truth to computability II , 2005, Theor. Comput. Sci..

[18]  Scott A. Smolka,et al.  Interactive Computation: The New Paradigm , 2006 .

[19]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[20]  Giorgi Japaridze,et al.  In the Beginning was Game Semantics? , 2005, Games: Unifying Logic, Language, and Philosophy.