Interpolation in Fragments of Classical Linear Logic

Research output: Contribution to journal/periodicalArticleScientificpeer-review


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.
Original languageEnglish
Pages (from-to)419
Number of pages25
JournalJournal of Symbolic Logic
Issue number2
Publication statusPublished - 1994


Dive into the research topics of 'Interpolation in Fragments of Classical Linear Logic'. Together they form a unique fingerprint.

Cite this