Results

**1 - 1**of**1**### Term Graphs and the NP-completeness of the Product-Free Lambek Calculus

"... Abstract. 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-comple ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract. 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 [8]. 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 [8]. 1