Games semantics for full propositional linear logic

We present a model of propositional classical linear logic (all the connective except for the additive constants) where the formulas are seen as two person games in which connectives are used as tokens, while the proofs are interpreted as strategies for one player. We discuss the intimate connection between these games and the structure of proofs, and prove a full completeness theorem. The main technical innovation is a "double negation" interpretation of CLL into intuitionistic linear logic.

[1]  Pierre-Louis Curien.  On the Symmetry of Sequentiality , 1993, MFPS.

[2]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..

[3]  Jean-Yves Girard,et al.  A new constructive logic: classic logic , 1991, Mathematical Structures in Computer Science.

[4]  Harvey M. Friedman,et al.  Classically and intuitionistically provably recursive functions , 1978 .

[5]  Radha Jagadeesan,et al.  Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..

[6]  Kuno Lorenz,et al.  Dialogspiele als Semantische Grundlage von Logikkalkülen , 1968 .

[7]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[8]  Pierre-Louis Curien,et al.  Sequential Algorithms on Concrete Data Structures , 1982, Theor. Comput. Sci..

[9]  Vincent Danos,et al.  A new deconstructive logic: linear logic , 1997, Journal of Symbolic Logic.

[10]  Radha Jagadeesan,et al.  Games and full completeness for multiplicative linear logic , 1992, Journal of Symbolic Logic.

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