Undecidability of Multiplicative Subexponential Logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Undecidability of Multiplicative Subexponential Logic


Subexponential logic is a variant of linear logic with a family of exponential connectives---called subexponentials---that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening and contraction. We show that classical propositional multiplicative linear logic extended with one unrestricted and two incomparable linear subexponentials can encode the halting problem for two register Minsky machines, and is hence undecidable.
Fichier principal
Vignette du fichier
main.pdf (108.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00998753 , version 1 (02-06-2014)


Attribution - NoDerivatives



Kaustuv Chaudhuri. Undecidability of Multiplicative Subexponential Logic. Proceedings of the Third International Workshop on Linearity, Jul 2014, Vienna, Austria. pp.1--8, ⟨10.4204/EPTCS.176.1⟩. ⟨hal-00998753⟩
449 View
179 Download



Gmail Facebook Twitter LinkedIn More