Free Algebras Corresponding to Multiplicative Classical Linear Logic and Some of Its Extensions

Notre Dame Journal of Formal Logic 37 (1):53-70 (1996)
  Copy   BIBTEX

Abstract

In this paper, constructions of free algebras corresponding to multiplicative classical linear logic, its affine variant, and their extensions with -contraction () are given. As an application, the cardinality problem of some one-variable linear fragments with -contraction is solved

Links

PhilArchive



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

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

Free ordered algebraic structures towards proof theory.Andreja Prijatelj - 2001 - Journal of Symbolic Logic 66 (2):597-608.
Connectification forn-contraction.Andreja Prijatelj - 1995 - Studia Logica 54 (2):149 - 171.
The logic of bunched implications.Peter W. O'Hearn & David J. Pym - 1999 - Bulletin of Symbolic Logic 5 (2):215-244.
The shuffle Hopf algebra and noncommutative full completeness.R. F. Blute & P. J. Scott - 1998 - Journal of Symbolic Logic 63 (4):1413-1436.
The conjoinability relation in Lambek calculus and linear logic.Mati Pentus - 1994 - Journal of Logic, Language and Information 3 (2):121-140.
Reflections on “difficult” embeddings.Andreja Prijatelj - 1995 - Journal of Philosophical Logic 24 (1):71 - 84.
Interpolation in fragments of classical linear logic.Dirk Roorda - 1994 - Journal of Symbolic Logic 59 (2):419-444.

Analytics

Added to PP
2010-08-24

Downloads
16 (#855,572)

6 months
2 (#1,157,335)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Free ordered algebraic structures towards proof theory.Andreja Prijatelj - 2001 - Journal of Symbolic Logic 66 (2):597-608.

Add more citations

References found in this work

Linear Logic.Jean-Yves Girard - 1987 - Theoretical Computer Science 50:1–102.
Extending intuitionistic linear logic with knotted structural rules.R. Hori, H. Ono & H. Schellinx - 1994 - Notre Dame Journal of Formal Logic 35 (2):219-242.
Sentential constants in systems near R.John Slaney - 1993 - Studia Logica 52 (3):443 - 455.
Connectification forn-contraction.Andreja Prijatelj - 1995 - Studia Logica 54 (2):149 - 171.

Add more references