Title :
Games semantics for linear logic
Author :
Lafont, Y. ; Streicher, T.
Author_Institution :
Lab. d´´Inf., CNRS-Ecole Normale Superieure, Paris, France
Abstract :
An attempt is made to relate various notions of duality used in mathematics with the denotational semantics of linear logic. The author proposes a naive semantics for linear logic that, in a certain sense, generalizes various notions such as finite-dimensional vector spaces, topological spaces, and J.-Y. Girard´s (1987) coherence spaces. A game consists of a set of vectors (or strategies), a set of forms (or co-strategies) and an evaluation bracket. This is enough to interpret the connectives of full propositional linear logic, including exponentials
Keywords :
duality (mathematics); formal logic; game theory; co-strategies; coherence spaces; denotational semantics; duality; evaluation bracket; exponentials; finite-dimensional vector spaces; forms; games semantics; mathematics; naive semantics; propositional linear logic; strategies; topological spaces; Books; Concurrent computing; Equations; Game theory; Linear algebra; Linearity; Logic; System recovery; Vectors;
Conference_Titel :
Logic in Computer Science, 1991. LICS '91., Proceedings of Sixth Annual IEEE Symposium on
Conference_Location :
Amsterdam
Print_ISBN :
0-8186-2230-X
DOI :
10.1109/LICS.1991.151629