Extended Kripke lemma and decidability for hypersequent substructural logics

DOI10.1145/3373718.3394802zbMATH Open1498.03056OpenAlexW3030674370WikidataQ130838796 ScholiaQ130838796MaRDI QIDQ5145681FDOQ5145681

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

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

zbMATH Keywords

proof theorydecidabilitysubstructural logics

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)

Cited In (4)

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

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)