On the Decision Problem for MELL - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2018

On the Decision Problem for MELL

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-01870148 , version 1

Citer

Lutz Strassburger. On the Decision Problem for MELL. [Research Report] 9203, Inria Saclay Ile de France. 2018. ⟨hal-01870148⟩
289 Consultations
440 Téléchargements

Partager

Gmail Facebook X LinkedIn More