Synthetic Undecidability of MSELL via FRACTRAN Mechanised in Coq - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

Synthetic Undecidability of MSELL via FRACTRAN Mechanised in Coq


We present an alternate undecidability proof for entailment in (intuitionistic) multiplicative subexponential linear logic (MSELL). We contribute the result and its mechanised proof to the Coq library of synthetic undecidability. The result crucially relies on the undecidability of the halting problem for two counters Minsky machines, which we also hand out to the library. As a seed of undecidability, we start from FRACTRAN halting which we (many-one) reduce to Minsky machines termination by implementing Euclidean division using two counters only. We then give an alternate presentation of those two counters machines as sequent rules, where computation is performed by proof-search, and halting reduced to provability. We use this system called non-deterministic two counters Minsky machines to describe and compare both the legacy reduction to linear logic, and the more recent reduction to MSELL. In contrast with that former MSELL undecidability proof, our correctness argument for the reduction uses trivial phase semantics in place of a focused calculus.
Fichier principal
Vignette du fichier
LIPIcs-FSCD-2021-18.pdf (900.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03280264 , version 1 (07-07-2021)



Dominique Larchey-Wendling. Synthetic Undecidability of MSELL via FRACTRAN Mechanised in Coq. 6th International Conference on Formal Structures for Computation and Deduction (FSCD 2021), Jul 2021, Buenos Aires, Argentina. ⟨10.4230/LIPIcs.FSCD.2021.18⟩. ⟨hal-03280264⟩
44 View
55 Download



Gmail Facebook X LinkedIn More