Product-free lambek calculus is NP-complete (2009)

by Y Savateev
Venue:in ‘Symposium on Logical Foundations of Computer Science (LFCS) 2009