Asynchronous games 4 : A fully complete model of propositional linear logic

Paul-André Melliès (1)

1 PPS - Preuves, Programmes et Systèmes

We construct a denotational model of propositional linear logic based on asynchronous games and winning uniform innocent strategies. Every formula A is interpreted as an asynchronous game [A] and every proof pi of A is interpreted as a winning uniform innocent strategy pi of the game A. We show that the resulting model is fully complete: every winning uniform innocent strategy sigma of the asynchronous game A is the denotation pi of a proof pi of the formula A.

Mots clés: game semantics; linear logic; full completeness; asynchronous games

Domaines: Logique en informatique [cs.LO]

Paul-André Melliès. Asynchronous games 4 : A fully complete model of propositional linear logic. LiCS 2005 -- Logic in Computer Science, Jun 2005, United States. pp.386-395. ⟨hal-00154301⟩