The monotone Lambek calculus is NP-complete
From MaRDI portal
Recommendations
Cites work
- Completeness Results for Lambek Syntactic Calculus
- Cut elimination and strong separation for substructural logics: an algebraic approach
- scientific article; zbMATH DE number 1222927 (Why is no real title available?)
- scientific article; zbMATH DE number 2070201 (Why is no real title available?)
- scientific article; zbMATH DE number 3231118 (Why is no real title available?)
- Language in action. Categories, lambdas and dynamic logic
- Product-Free Lambek Calculus Is NP-Complete
- The atomic theory of left division of two-sided ideals of semirings with unit
- The atomic theory of multiplication and division of semiring ideals
- The Mathematics of Sentence Structure
Cited in
(8)- Lambek calculus is NP-complete
- Lambek calculus with a unit and one division
- Term graphs and the NP-completeness of the product-free Lambek calculus
- The product-free Lambek-Grishin calculus is NP-complete
- Product-Free Lambek Calculus Is NP-Complete
- LaserTank is NP-Complete
- An application of proof-nets to the study of fragments of the Lambek calculus
- Complete problems for monotone NP
This page was built for publication: The monotone Lambek calculus is NP-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5414974)