On the decision problem for MELL - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2019

On the decision problem for MELL

(1, 2)
1
2

Abstract

In this short paper I will exhibit several mistakes in the recent attempt by Bimbó [3] 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 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 [3], and a semantic proof can be found in [35].
Fichier principal
Vignette du fichier
OnDeciMELL.pdf (168.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02386746 , version 1 (29-11-2019)

Identifiers

Cite

Lutz Strassburger. On the decision problem for MELL. Theoretical Computer Science, 2019, 768, pp.91-98. ⟨10.1016/j.tcs.2019.02.022⟩. ⟨hal-02386746⟩
30 View
106 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More