| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436628 | Theoretical Computer Science | 2006 | 16 Pages |
Abstract
We prove that for both the Lambek calculus L and the Lambek calculus allowing empty premises L* the derivability problem is NP-complete. It follows that also for the multiplicative fragments of cyclic linear logic and noncommutative linear logic the derivability problem is NP-complete.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
