Extended Kripke lemma and decidability for hypersequent substructural logics

DOI10.1145/3373718.3394802zbMath1498.03056OpenAlexW3030674370WikidataQ130838796 ScholiaQ130838796MaRDI QIDQ5145681

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)

Related Items (2)

Focused proof-search in the logic of bunched implications ⋮ BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS

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