System NEL is Undecidable

DOI10.1016/S1571-0661(04)80853-3zbMath1264.03124MaRDI QIDQ4924537

Lutz Straßburger

Publication date: 6 June 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (6)

MELL in the calculus of structures ⋮ A System of Interaction and Structure III: The Complexity of BV and Pomset Logic ⋮ On the decision problem for MELL ⋮ Linear Lambda Calculus and Deep Inference ⋮ The fixed point problem of a simple reversible language ⋮ System BV is NP-complete

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Decision problems for propositional linear logic
• Linear logic as a logic of computations
• The complexity of Horn fragments of linear logic
• The undecidability of second order multiplicative linear logic
• A Local System for Classical Logic
• How to Program an Infinite Abacus
• The mix rule
• Games and full completeness for multiplicative linear logic
• The undecidability of second order linear logic without exponentials
• A system of interaction and structure

This page was built for publication: System NEL is Undecidable