Summary: Concurrent Games and Full Completeness
LFCS, Division of Informatics
Univ. of Edinburgh
Equipe de Logique Math´ematique
CNRS, Univ. Paris 7
A new concurrent form of game semantics is introduced.
This overcomes the problems which had arisen with previ-
ous, sequential forms of game semantics in modelling Lin-
ear Logic. It also admits an elegant and robust formal-
ization. A Full Completeness Theorem for Multiplicative-
Additive Linear Logic is proved for this semantics.
This paper contains two main contributions: