Game semantics and abstract machines
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Chu's construction: a proof-theoretic approach
Logic for concurrency and synchronisation
Sequentiality vs. concurrency in games and logic
Mathematical Structures in Computer Science
Generation in the Lambek calculus framework: an approach with semantic proof nets
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Geometry of lexico-syntactic interaction
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Generation, Lambek calculus, Montague's semantics and semantic proof nets
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Syntax vs. semantics: a polarized approach
Theoretical Computer Science - Game theory meets theoretical computer science
Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
A Game Semantics for Proof Search: Preliminary Results
Electronic Notes in Theoretical Computer Science (ENTCS)
Playing logic programs with the alpha-beta algorithm
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Proof-search in implicative linear logic as a matching problem
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
| Hi-index | 0.00 |
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.