Z-modules and full completeness of multiplicative linear logic

Annals of Pure and Applied Logic 107 (1-3):165-191 (2001)
  Copy   BIBTEX

Abstract

We prove that the full completeness theorem for MLL+Mix holds by the simple interpretation via formulas as objects and proofs as Z-invariant morphisms in the *-autonomous category of topologized vector spaces. We do this by generalizing the recent work of Blute and Scott 101–142) where they used the semantical framework of dinatural transformation introduced by Girard–Scedrov–Scott , Logic from Computer Science, vol. 21, Springer, Berlin, 1992, pp. 217–241). By omitting the use of dinatural transformation, our semantics evidently allows the interpretation of the cut-rule, while the original Blute–Scott's does not. Moreover, our interpretation for proofs is preserved automatically under the cut elimination procedure. In our semantics proofs themselves are characterized by the concrete algebraic notion “Z-invariance”, and our denotational semantics provides the full completeness. Our semantics is naturally extended to the full completeness semantics for CyLL+Mix owing to an elegant method of Blute–Scott 1413–1436) 101–142))).

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Modularity of proof-nets.Roberto Maieli & Quintijn Puite - 2005 - Archive for Mathematical Logic 44 (2):167-193.
The shuffle Hopf algebra and noncommutative full completeness.R. F. Blute & P. J. Scott - 1998 - Journal of Symbolic Logic 63 (4):1413-1436.
The logic of bunched implications.Peter W. O'Hearn & David J. Pym - 1999 - Bulletin of Symbolic Logic 5 (2):215-244.
The conjoinability relation in Lambek calculus and linear logic.Mati Pentus - 1994 - Journal of Logic, Language and Information 3 (2):121-140.
The Propositional Logic of Elementary Tasks.Giorgi Japaridze - 2000 - Notre Dame Journal of Formal Logic 41 (2):171-183.
Planar and braided proof-nets for multiplicative linear logic with mix.G. Bellin & A. Fleury - 1998 - Archive for Mathematical Logic 37 (5-6):309-325.

Analytics

Added to PP
2014-01-16

Downloads
20 (#763,203)

6 months
7 (#419,182)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Softness of hypercoherences and full completeness.Richard Blute, Masahiro Hamano & Philip Scott - 2005 - Annals of Pure and Applied Logic 131 (1-3):1-63.

Add more citations

References found in this work

Quantales and (noncommutative) linear logic.David N. Yetter - 1990 - Journal of Symbolic Logic 55 (1):41-64.
The structure of multiplicatives.Vincent Danos & Laurent Regnier - 1989 - Archive for Mathematical Logic 28 (3):181-203.
Linear logic: its syntax and semantics.Jean-Yves Girard - 1995 - In Jean-Yves Girard, Yves Lafont & Laurent Regnier (eds.), Advances in Linear Logic. Cambridge University Press. pp. 222--1.
Linear Läuchli semantics.R. F. Blute & P. J. Scott - 1996 - Annals of Pure and Applied Logic 77 (2):101-142.

View all 6 references / Add more references