Lambek calculus is NP-complete

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.

DOI: 10.1016/j.tcs.2006.03.018

Extracted Key Phrases

Statistics

01020'05'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

58 Citations

Semantic Scholar estimates that this publication has 58 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Pentus2006LambekCI, title={Lambek calculus is NP-complete}, author={Mati Pentus}, journal={Theor. Comput. Sci.}, year={2006}, volume={357}, pages={186-201} }