FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE

DOI10.1017/JSL.2015.18zbMath1355.03013OpenAlexW2474875069MaRDI QIDQ3188328

Karel Chvalovský, Rostislav Horčík

Publication date: 19 August 2016

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jsl.2015.18

zbMATH Keywords

decidabilitysubstructural logicequational theorycontraction rulefull Lambek calculussquare-increasing residuated lattice

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)

Related Items (6)

MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE ⋮ Versions of a local contraction subexponential in the Lambek calculus ⋮ Relational Models for the Lambek Calculus with Intersection and Constants ⋮ Relational models for the Lambek calculus with intersection and unit ⋮ Semiconic idempotent logic. I: Structure and local deduction theorems. ⋮ Extensions of Lambek Calculi

Cites Work

• Unnamed Item
• Algebraic proof theory for substructural logics: cut-elimination and completions
• Residuated lattices. An algebraic glimpse at substructural logics
• Predicate logics without the structure rules
• The contraction rule and decision problems for logics without structural rules
• Decision problems for propositional linear logic
• Untersuchungen über das logische Schliessen. I
• Untersuchungen über das logische Schliessen. II
• Word problem for knotted residuated lattices.
• ALGORITHMIC PROBLEMS IN VARIETIES

This page was built for publication: FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE