The decidability of the intensional fragment of classical linear logic

DOI10.1016/J.TCS.2015.06.019zbMATH Open1331.03014OpenAlexW613960602WikidataQ56340934 ScholiaQ56340934MaRDI QIDQ2517231FDOQ2517231

Authors: 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

Recommendations

• scientific article; zbMATH DE number 786489
• Decidability of linear affine logic
• The finite model property for various fragments of linear logic
• The undecidability of second order multiplicative linear logic
• Decision problems for propositional linear logic

zbMATH Keywords

decidabilitylinear logicsubstructural logicscut eliminationsequent calculusrelevance logic

Mathematics Subject Classification ID

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

Cites Work

• The semantics and proof theory of linear logic
• Decision problems for propositional linear logic
• Kripke models for linear logic
• Generalized Galois logics. Relational semantics of nonclassical logical calculi
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the decidability of implicational ticket entailment
• Title not available (Why is that?)
• Title not available (Why is that?)
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
• Linear logic
• Linear logic displayed
• Soft linear logic and polynomial time
• Positive modal logic
• The blind spot. Lectures on logic
• Philosophy of logic
• Title not available (Why is that?)
• What is relevance logic?
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decidability of linear affine logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constant-only multiplicative linear logic is NP-complete
• Proof theory. Sequent calculi and related formalisms
• Title not available (Why is that?)

Cited In (13)

• Title not available (Why is that?)
• The undecidability theorem for the Horn-like fragment of linear logic (revisited)
• Current trends in substructural logics
• Constructive decision via redundancy-free proof-search
• On the decision problem for MELL
• Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
• The decidability of a fragment of \(\text{BB}'\text{IW}\)-logic
• Interpretations of weak positive modal logics
• Decidability of linear affine logic
• A decision procedure revisited: Notes on direct logic, linear logic and its implementation
• Nonmodal classical linear predicate logic is a fragment of intuitionistic linear logic
• The development of decidability proofs based on sequent calculi
• Title not available (Why is that?)

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

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