Games and Full Completeness for Multiplicative Linear Logic

Games and Full Completeness for Multiplicative Linear Logic (1994)

by Samson Abramsky , Radha Jagadeesan

Venue:	JOURNAL OF SYMBOLIC LOGIC
Citations:	197 - 25 self

User correction supplied by mph

Datum	Value	Source
TITLE	Games and Full Completeness for Multiplicative Linear Logic	user correction - Legacy Corrections
AUTHOR NAME	Samson Abramsky	user correction
AUTHOR AFFIL	Department of Computing; Imperial College of Science, Technology and Medicine	user correction
AUTHOR NAME	Radha Jagadeesan	user correction
AUTHOR AFFIL	Department of Computing; Imperial College of Science, Technology and Medicine	user correction
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 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.	user correction - Legacy Corrections
YEAR	1994	INFERENCE
VENUE	JOURNAL OF SYMBOLIC LOGIC	user correction
VENUE TYPE	JOURNAL	INFERENCE
PAGES	543--574	INFERENCE
VOLUME	59	INFERENCE
CITATIONS	39 found	ParsCit 1.0