Abstract
In this paper, we prove that the derivability problems for product-free Lambek calculus and product-free Lambek calculus allowing empty premises are NP-complete. Also we introduce a new derivability characterization for these calculi.
| Original language | English |
|---|---|
| Pages (from-to) | 775-788 |
| Journal | Annals of Pure and Applied Logic |
| Volume | 163 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - Jul 2012 |
Keywords
- Lambek calculus
- Algorithmic complexity
- Proof nets
Fingerprint
Dive into the research topics of 'Product-free Lambek calculus is NP-complete'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver