Concurrent Games and Full Completeness

A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It also admits an elegant and robust formalization. A Full Completeness Theorem for MultiplicativeAdditive Linear Logic is proved for this semantics.

• Type: Conference
• Year: 1999
• Where: LICS
• Authors: Samson Abramsky, Paul-André Melliès
• Keywords: Automated Reasoning, Full Completeness Theorem, Game Semantics, LICS 1999, Linear Logic