The undecidability theorem for the Horn-like fragment of linear logic (revisited)

DOI10.1017/S0960129516000049MaRDI QIDQ5741577zbMATH OpenOpenAlexFDO

Authors Max Kanovich

Publication date 28 July 2016

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129516000049

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• Decision problems for propositional linear logic
• scientific article; zbMATH DE number 1841812
• The complexity of Horn fragments of linear logic
• The decidability of the intensional fragment of classical linear logic
• Linear logic as a logic of computations

Cites work

• An Algorithm for the General Petri Net Reachability Problem
• Decision problems for propositional linear logic
• Linear logic
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines

Cited in

(4)

• scientific article; zbMATH DE number 786489 (Why is no real title available?)
• The complexity of Horn fragments of linear logic
• scientific article; zbMATH DE number 5295720 (Why is no real title available?)
• Synthetic Undecidability of MSELL via FRACTRAN Mechanised in Coq

This page was built for publication: The undecidability theorem for the Horn-like fragment of linear logic (revisited)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741577)