Journal of Symbolic Logic

Interpolation in Fragments of Classical Linear Logic

Dirk Roorda

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.


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 $(\rightarrow, +)$, 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.

Article information

J. Symbolic Logic, Volume 59, Issue 2 (1994), 419-444.

First available in Project Euclid: 6 July 2007

Permanent link to this document

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier



Roorda, Dirk. Interpolation in Fragments of Classical Linear Logic. J. Symbolic Logic 59 (1994), no. 2, 419--444.

Export citation