Skip to main content

Term graphs and the NP-completeness of the product-free Lambek calculus

Citations of this article
Mendeley users who have this article in their library.
Get full text


We provide a graphical representation of proofs in the product-free Lambek calculus, called term graphs, that is related to several other proof net presentations. The advantage of term graphs is that they are very simple compared to the others. We use this advantage to provide an NP-completeness proof of the product-free Lambek Calculus that uses the reduction of [1]. Our proof is more intuitive due to the fact that term graphs allow arguments that are graphical in nature rather than using the algebraic arguments of [1]. © 2011 Springer-Verlag.




Fowler, T. A. D. (2011). Term graphs and the NP-completeness of the product-free Lambek calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5591 LNAI, pp. 150–166).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free