https://hal.inria.fr/hal-02386746Strassburger, LutzLutzStrassburgerPARSIFAL - Proof search and reasoning with logic specifications - LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau] - X - École polytechnique - CNRS - Centre National de la Recherche Scientifique - Inria Saclay - Ile de France - Inria - Institut National de Recherche en Informatique et en AutomatiqueLIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau] - X - École polytechnique - CNRS - Centre National de la Recherche ScientifiqueOn the decision problem for MELLHAL CCSD2019[INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO]Straßburger, Lutz2019-11-29 14:31:322023-03-24 14:53:142019-11-29 14:40:37enJournal articleshttps://hal.inria.fr/hal-02386746/document10.1016/j.tcs.2019.02.022application/pdf1In 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].