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

DOI10.1017/S0960129516000049zbMath1362.03011OpenAlexW2346730081MaRDI QIDQ5741577

Max I. 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)

Cites Work

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

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