Аннотация:We survey results on algorithmic complexity of extensions of the Lambek calculus. We classify these extensions as “harmless,” which do not increase complexity, and “dangerous,” which make decision problems undecidable. For the latter, we focus on extensions with subexponentials and with Kleene star.