75
Voted
LFCS
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we prove that the derivability problems for productfree Lambek calculus and product-free Lambek calculus allowing empty premises are NP-complete. Also we introduce a...