| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4661870 | Annals of Pure and Applied Logic | 2012 | 14 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
