Decidability and complexity in weakening and contraction hypersequent substructural logics

DOI10.1109/LICS52264.2021.9470733MaRDI QIDQ6651961zbMATH OpenFDO

Authors

Publication date 11 December 2024

Full work available at URL https://doi.org/10.1109/LICS52264.2021.9470733

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

• Extended Kripke lemma and decidability for hypersequent substructural logics
• scientific article; zbMATH DE number 1420859
• FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE
• MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE
• scientific article; zbMATH DE number 54580

Cited in

(3)

• MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE
• On the length of strongly monotone descending chains over \(\mathbb{N}^d\)
• Tight length theorems for multiset extensions of Higman's lemma

This page was built for publication: Decidability and complexity in weakening and contraction hypersequent substructural logics

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