scientific article; zbMATH DE number 1222927
From MaRDI portal
Publication:4218528
zbMath0920.03042MaRDI QIDQ4218528
Publication date: 31 August 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lambek calculuscompleteness theoremproof netsalgebras of languagesfree monoid modelsmultiplicative fragment of noncommutative linear logic
Other nonclassical logic (03B60) Logic of natural languages (03B65) Natural language processing (68T50) Nonclassical models (Boolean-valued, sheaf, etc.) (03C90)
Related Items
Trivalent logics arising from L-models for the Lambek calculus with constants, Language models for some extensions of the Lambek calculus, Embedding of the atomic theory of subsets of free semigroups to the atomic theory of subsets of free monoids, Relational Models for the Lambek Calculus with Intersection and Constants, The displacement calculus, Explorations in Subexponential Non-associative Non-commutative Linear Logic, L-Completeness of the Lambek Calculus with the Reversal Operation Allowing Empty Antecedents, The Monotone Lambek Calculus Is NP-Complete, Lambek calculus is NP-complete, Lambek calculus with one division and one primitive type permitting empty antecedents, Unnamed Item, Subexponentials in non-commutative linear logic, COMPLEXITY OF THE INFINITARY LAMBEK CALCULUS WITH KLEENE STAR