1. Bransen, J.: The Lambek-Grishin calculus is NP-complete. In: Proceedings 15th Conference on Formal Grammar, Copenhagen (2010) (to appear)
2. Lecture Notes in Artificial Intelligence;P. Groote de,1999
3. Foret, A.: On the computation of joins for non associative Lambek categorial grammars. In: Proceedings of the 17th International Workshop on Unification (UNIF 2003), Valencia, Spain, June 8-9 (2003)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
5. Goré, R.: Substructural logics on display. Logic Jnl IGPL 6(3), 451–504 (1998)