On the decision problem for MELL
From MaRDI portal
Publication:1733062
DOI10.1016/j.tcs.2019.02.022zbMath1454.03084OpenAlexW2898547131MaRDI QIDQ1733062
Publication date: 26 March 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-02386746/file/OnDeciMELL.pdf
Decidability of theories and sets of sentences (03B25) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items
Constructive decision via redundancy-free proof-search, Non-associative, non-commutative multi-modal linear logic
Uses Software
Cites Work
- Unnamed Item
- 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
- Turning cycles into spirals
- The complexity of Horn fragments of linear logic
- MELL in the calculus of structures
- The undecidability of second order multiplicative linear logic
- System BV is NP-complete
- The decidability of the intensional fragment of classical linear logic
- Parallel program schemata
- A system of interaction and structure IV
- Nonelementary Complexities for Branching VASS, MELL, and Extensions
- A system of interaction and structure V: the exponentials and splitting
- IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE
- A completeness theorem in modal logic
- Normalisation Control in Deep Inference via Atomic Flows
- An Algorithm for the General Petri Net Reachability Problem
- How to Program an Infinite Abacus
- The finite model property for various fragments of intuitionistic linear logic
- Demystifying Reachability in Vector Addition Systems
- System NEL is Undecidable
- The complexity of decision procedures in relevance logic II
- A system of interaction and structure
- A Decision Procedure For the System EĪ of Entailment with Negation
