The decidability of the intensional fragment of classical linear logic

DOI10.1016/j.tcs.2015.06.019zbMath1331.03014OpenAlexW613960602WikidataQ56340934 ScholiaQ56340934MaRDI QIDQ2517231

Katalin Bimbó

Publication date: 17 August 2015

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.019

zbMATH Keywords

cut eliminationsequent calculusdecidabilitylinear logicsubstructural logicsrelevance logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (4)

Current trends in substructural logics ⋮ On the decision problem for MELL ⋮ Constructive decision via redundancy-free proof-search ⋮ Interpretations of Weak Positive Modal Logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• What is relevance logic?
• Linear logic
• Philosophy of logic
• Linear logic displayed
• The semantics and proof theory of linear logic
• Decision problems for propositional linear logic
• Constant-only multiplicative linear logic is NP-complete
• Soft linear logic and polynomial time
• Decidability of linear affine logic
• Positive modal logic
• Kripke models for linear logic
• The Blind Spot
• On the decidability of implicational ticket entailment
• Proof Theory
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi

This page was built for publication: The decidability of the intensional fragment of classical linear logic