Lambek calculus is NP-complete

Mati Pentus. Lambek calculus is NP-complete. Theoretical Computer Science, 357(1-3):186-201, 2006. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: