Constructing Fully Complete Models for Multiplicative Linear Logic

Authors:
Andrea Schalk;Hugh Steele
Affiliations:
-;-
Venue:
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Year:
2012

Citing 4
Cited 0

Linear logic

Theoretical Computer Science
Games and full completeness for multiplicative linear logic

Journal of Symbolic Logic
Glueing and orthogonality for models of linear logic

Theoretical Computer Science - Category theory and computer science
Full Completeness of the Multiplicative Linear Logic of Chu Spaces

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We demonstrate how the Hyland-Tan double glueing construction produces a fully complete model of the unit-free multiplicative fragment of Linear Logic when applied to any of a large family of degenerative ones. This process explains as special cases a number of such models which appear in the literature. In order to achieve this result, we make use of a tensor calculus for compact closed categories with finite biproducts. We show how the combinatorial properties required for a fully complete model are obtained by the construction adding to those already available from the original category.