The Lambek-Grishin calculus is NP-complete
Jeroen Bransen
TL;DR
This paper proves that the derivability problem for the Lambek-Grishin calculus, an extension of the non-associative Lambek calculus, is NP-complete, indicating computational complexity.
Contribution
It establishes the NP-completeness of the derivability problem for the Lambek-Grishin calculus, a significant complexity result for this logical system.
Findings
Derivability problem for LG is NP-complete
LG extends NL with symmetric features
Complexity classification of LG logic
Abstract
The Lambek-Grishin calculus LG is the symmetric extension of the non-associative Lambek calculus NL. In this paper we prove that the derivability problem for LG is NP-complete.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Advanced Algebra and Logic · Polynomial and algebraic computation