Abstract
We use proof-nets to study the algorithmic complexity of the derivability problem for some fragments of the Lambek calculus. We prove the NP-completeness of this problem for the unidirectional fragment and the product-free fragment, and also for versions of these fragments that admit empty antecedents.
| Original language | English |
|---|---|
| Pages (from-to) | 631-663 |
| Journal | Izvestiya: Mathematics |
| Volume | 75 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2011 |
Keywords
- Lambek calculus
- Algorithmic complexity
- Proof nets