Interpolation in fragments of classical linear logic

Journal of Symbolic Logic 59 (2):419-444 (1994)
Abstract
We study interpolation for elementary fragments of classical linear logic. Unlike in intuitionistic logic (see [Renardel de Lavalette, 1989]) there are fragments in linear logic for which interpolation does not hold. We prove interpolation for a lot of fragments and refute it for the multiplicative fragment (→, +), using proof nets and quantum graphs. We give a separate proof for the fragment with implication and product, but without the structural rule of permutation. This is nearly the Lambek calculus. There is an appendix explaining what quantum graphs are and how they relate to proof nets
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275398
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,370
Through your library
References found in this work BETA
The Structure of Multiplicatives.Vincent Danos & Laurent Regnier - 1989 - Archive for Mathematical Logic 28 (3):181-203.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
9 ( #472,511 of 2,193,887 )

Recent downloads (6 months)
1 ( #291,271 of 2,193,887 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature