Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T15:25:38.026Z Has data issue: false hasContentIssue false

Interpolation in fragments of classical linear logic

Published online by Cambridge University Press:  12 March 2014

Dirk Roorda*
Affiliation:
Department of Computer Science, Rijksuniversiteit Groningen, 9747 AC Groningen, The Netherlands

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable