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 . 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 . © 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). https://doi.org/10.1007/978-3-642-20169-1_10