Extended Kripke lemma and decidability for hypersequent substructural logics

DOI10.1145/3373718.3394802MaRDI QIDQ5145681zbMATH OpenOpenAlexWikidataFDO

Authors Revantha Ramanayake

Publication date 21 January 2021

Published in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3373718.3394802

zbMATH Keywords

decidabilityproof theorysubstructural logics

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)

Recommendations

• FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE
• scientific article; zbMATH DE number 1523044
• Bounded sequent calculi for non-classical logics via hypersequents
• Cyclic Involutive Distributive Full Lambek Calculus is Decidable
• scientific article; zbMATH DE number 1138593

Cited in

(5)

• Focused proof-search in the logic of bunched implications
• Decidable Extensions of Hennessy-Milner Logic
• MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE
• BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS
• Decidability and complexity in weakening and contraction hypersequent substructural logics

This page was built for publication: Extended Kripke lemma and decidability for hypersequent substructural logics

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