Paper Info
Title
Games and full completeness for multiplicative linear logic
Abstract
We present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net. A key role is played by the notion of {\em history-free} strategy; strong connections are made between history-free strategies and the Geometry of Interaction. Our semantics incorporates a natural notion of polarity, leading to a refined treatment of the additives. We make comparisons with related work by Joyal, Blass et al.
Year
DOI
Venue
2013
10.2307/2275407
Journal of Symbolic Logic
Keywords
DocType
Volume
full completeness,multiplicative linear logic
Journal
abs/1311.6057
Issue
ISSN
Citations 
2
Journal of Symbolic Logic (1994), volume 59 no. 2, pages 543-574
177
PageRank 
References 
Authors
13.54
19
2
Search Limit
100177
Name
Order
Citations
PageRank
Samson Abramsky13169348.51
Radha Jagadeesan22117121.75