Abstract

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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call