Affordable Access

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

Authors
Publication Date
Source
Hal-Diderot
Keywords
  • Game Semantics
  • Linear Logic
  • Full Completeness
  • Asynchronous Games
  • [Info.Info-Lo] Computer Science [Cs]/Logic In Computer Science [Cs.Lo]
External links

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments