Connectification forn-contraction

Studia Logica 54 (2):149 - 171 (1995)
  Copy   BIBTEX

Abstract

In this paper, we introduce connectification operators for intuitionistic and classical linear algebras corresponding to linear logic and to some of its extensions withn-contraction. In particular,n-contraction (n2) is a version of the contraction rule, wheren+1 occurrences of a formula may be contracted ton occurrences. Since cut cannot be eliminated from the systems withn-contraction considered most of the standard proof-theoretic techniques to investigate meta-properties of those systems are useless. However, by means of connectification we establish the disjunction property for both intuitionistic and classical affine linear logics withn-contraction.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,283

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
46 (#347,824)

6 months
5 (#648,018)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Linear Logic.Jean-Yves Girard - 1987 - Theoretical Computer Science 50:1–102.
The Lambek calculus enriched with additional connectives.Makoto Kanazawa - 1992 - Journal of Logic, Language and Information 1 (2):141-171.
Lectures on Linear Logic.Anne Sjerp Troelstra - 1992 - Center for the Study of Language and Information Publications.
On the Freyd cover of a topos.Ieke Moerdijk - 1983 - Notre Dame Journal of Formal Logic 24 (4):517-526.

Add more references