On the Decision Problem for MELL - INRIA - Institut National de Recherche en Informatique et en Automatique Access content directly
Reports (Research Report) Year : 2018

On the Decision Problem for MELL


In this short paper I will exhibit several mistakes in the recent attempt by Bimbò to prove the decidability of the multiplicative exponential fragment of linear logic (MELL). In fact, the main mistake is so serious that there is no obvious fix, and therefore the decidability of MELL remains to be an open problem. As a side effect, this paper contains a complete (syntactic) proof of the decidability of the relevant version of MELL (called RMELL in this paper), that is the logic obtained from MELL by replacing the linear logic contraction rule by a general unrestricted version of the contraction rule. This proof can also be found (with a small error) in Bimbò's work, and a semantic proof has been given by Okada and Terui.
Fichier principal
Vignette du fichier
RR-9203.pdf (676.74 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01870148 , version 1 (07-09-2018)


  • HAL Id : hal-01870148 , version 1


Lutz Strassburger. On the Decision Problem for MELL. [Research Report] 9203, Inria Saclay Ile de France. 2018. ⟨hal-01870148⟩
317 View
444 Download


Gmail Mastodon Facebook X LinkedIn More