UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS

DOI10.1017/jsl.2014.39zbMath1373.03025OpenAlexW2397996385MaRDI QIDQ5501771

Karel Chvalovský

Publication date: 14 August 2015

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

Full work available at URL: https://semanticscholar.org/paper/f1691c48b7ea834ffabe137a4e9a28f4377f4428

zbMATH Keywords

undecidabilityword problemconsequence relationsubstructural logicsrewriting systemstag systems

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

On Classical Nonassociative Lambek Calculus, Explorations in Subexponential Non-associative Non-commutative Linear Logic, Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability, Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids, Extensions of Lambek Calculi, Non-associative, non-commutative multi-modal linear logic

Cites Work

• Unnamed Item
• Cut elimination and strong separation for substructural logics: an algebraic approach
• Residuated lattices. An algebraic glimpse at substructural logics
• Sequent-systems and groupoid models. I
• Extending intuitionistic linear logic with knotted structural rules
• The finite embeddability property for residuated groupoids.
• The Mathematics of Sentence Structure
• Some Decision Problems in the Theory of Syntactic Categories
• Universality of Tag Systems with P = 2
• Formal Reductions of the General Combinatorial Decision Problem