Linear Läuchli semantics

Annals of Pure and Applied Logic 77 (2):101-142 (1996)
  Copy   BIBTEX

Abstract

We introduce a linear analogue of Läuchli's semantics for intuitionistic logic. In fact, our result is a strengthening of Läuchli's work to the level of proofs, rather than provability. This is obtained by considering continuous actions of the additive group of integers on a category of topological vector spaces. The semantics, based on functorial polymorphism, consists of dinatural transformations which are equivariant with respect to all such actions. Such dinatural transformations are called uniform. To any sequent in Multiplicative Linear Logic , we associate a vector space of“diadditive” uniform transformations. We then show that this space is generated by denotations of cut-free proofs of the sequent in the theory MLL + MIX. Thus we obtain a full completeness theorem in the sense of Abramsky and Jagadeesan, although our result differs from theirs in the use of dinatural transformations.As corollaries, we show that these dinatural transformations compose, and obtain a conservativity result: diadditive dinatural transformations which are uniform with respect to actions of the additive group of integers are also uniform with respect to the actions of arbitrary cocommutative Hopf algebras. Finally, we discuss several possible extensions of this work to noncommutative logic.It is well known that the intuitionistic version of Läuchli's semantics is a special case of the theory of logical relations, due to Plotkin and Statman. Thus, our work can also be viewed as a first step towards developing a theory of logical relations for linear logic and concurrency

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,621

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

The shuffle Hopf algebra and noncommutative full completeness.R. F. Blute & P. J. Scott - 1998 - Journal of Symbolic Logic 63 (4):1413-1436.
Z-modules and full completeness of multiplicative linear logic.Masahiro Hamano - 2001 - Annals of Pure and Applied Logic 107 (1-3):165-191.
Softness of hypercoherences and full completeness.Richard Blute, Masahiro Hamano & Philip Scott - 2005 - Annals of Pure and Applied Logic 131 (1-3):1-63.
Coherent phase spaces. Semiclassical semantics.Sergey Slavnov - 2005 - Annals of Pure and Applied Logic 131 (1-3):177-225.
G-dinaturality.Zoran Petrić - 2003 - Annals of Pure and Applied Logic 122 (1-3):131-173.
The Uniform Proof-theoric Foundation of Linear Logic Programming: Extended Abstract.James Harland & David J. Pym - 1991 - LFCS, Department of Computer Science, University of Edinburgh.
Imperative programs as proofs via game semantics.Martin Churchill, Jim Laird & Guy McCusker - 2013 - Annals of Pure and Applied Logic 164 (11):1038-1078.

Analytics

Added to PP
2014-01-16

Downloads
28 (#891,791)

6 months
3 (#1,176,106)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Proofs and types.Jean-Yves Girard - 1989 - New York: Cambridge University Press.
Quantales and (noncommutative) linear logic.David N. Yetter - 1990 - Journal of Symbolic Logic 55 (1):41-64.
Intensional interpretations of functionals of finite type I.W. W. Tait - 1967 - Journal of Symbolic Logic 32 (2):198-212.
The structure of multiplicatives.Vincent Danos & Laurent Regnier - 1989 - Archive for Mathematical Logic 28 (3):181-203.

View all 8 references / Add more references