scientific article; zbMATH DE number 1341472
From MaRDI portal
zbMath0933.03017MaRDI QIDQ4263011
Publication date: 20 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decidabilityLambek calculuspolynomial-time complexitycomplete axiomatisationcalculus with contextstime complexity of the decision problem
Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)
Related Items
\(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures, Lambek Grammars with One Division Are Decidable in Polynomial Time, Product-free Lambek calculus is NP-complete, k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures, Lambek calculus is NP-complete, Unidirectional Lambek grammars in polynomial time, Product-Free Lambek Calculus Is NP-Complete, Unnamed Item