Product-Free Lambek Calculus Is NP-Complete

Yury Savateev. Product-Free Lambek Calculus Is NP-Complete. In Sergei N. Artëmov, Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings. Volume 5407 of Lecture Notes in Computer Science, pages 380-394, Springer, 2009. [doi]

Abstract

Abstract is missing.