Linear logic with fixed resources

Annals of Pure and Applied Logic 67 (1-3):3-28 (1994)
  Copy   BIBTEX

Abstract

In this paper we continue the study of Girard's Linear Logic and introduce a new Linear Logic with modalities. Our logic describes not only the consumption, but also the presence of resources. We introduce a new semantics and a new calculus for this logic. In contrast to the results of Lincoln [7] and Kanovich [4] about the NP-completeness of the problem of the construction of a proof for a given sequent in the multiplicative fragment of Girard's Linear Logic, we present here a non-exponential algorithm to construct a proof for a given sequent and a given point of a given model in our Linear Logic.

Other Versions

No versions found

Links

PhilArchive

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

Non-commutative logic I: the multiplicative fragment.V. Michele Abrusci & Paul Ruet - 1999 - Annals of Pure and Applied Logic 101 (1):29-64.
On Resolution in Fragments of Classical Linear Logic: (extended Abstract).J. A. Harland & David J. Pym - 1992 - LFCS, Department of Computer Science, University of Edinburgh.
The Semantics and Proof Theory of Linear Logic.Arnon Avron - 1988 - Theoretical Computer Science 57 (2):161-184.
A game semantics for linear logic.Andreas Blass - 1992 - Annals of Pure and Applied Logic 56 (1-3):183-220.
An alternative linear semantics for allowed logic programs.John Jeavons - 1997 - Annals of Pure and Applied Logic 84 (1):3-16.

Analytics

Added to PP
2014-01-16

Downloads
81 (#699,201)

6 months
15 (#807,222)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

In memoriam: Mikhail A. Taitslin 1936–2013.Oleg Belegradek & Boris Zilber - 2014 - Bulletin of Symbolic Logic 20 (1):99-102.

Add more citations

References found in this work

Add more references