A Completeness Theorem for the Lambek Calculus of Syntactic Categories
From MaRDI portal
Publication:3677747
DOI10.1002/malq.19850311405zbMath0564.03029OpenAlexW2007180849MaRDI QIDQ3677747
Publication date: 1985
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19850311405
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Semigroups in automata theory, linguistics, etc. (20M35) Categoricity and completeness of theories (03C35)
Related Items (8)
On the completeness of the Lambek calculus with respect to relativized relational semantics ⋮ Models for the Lambek calculus ⋮ Some lattice models of bilinear logic ⋮ Sequent-systems and groupoid models. I ⋮ Fibred semantics for feature-based grammar logic ⋮ Language in action ⋮ The finite model property for BCI and related systems ⋮ On finite models of the Lambek calculus
This page was built for publication: A Completeness Theorem for the Lambek Calculus of Syntactic Categories
