On the complexity of the Lambek-Grishin calculus

dc.rights.license	CC-BY-NC-ND
dc.contributor.advisor	Moortgat, M.
dc.contributor.advisor	Iemhoff, R.
dc.contributor.author	Bransen, J.
dc.date.accessioned	2010-08-30T17:01:29Z
dc.date.available	2010-08-30
dc.date.available	2010-08-30T17:01:29Z
dc.date.issued	2010
dc.identifier.uri	https://studenttheses.uu.nl/handle/20.500.12932/5426
dc.description.abstract	The Lambek-Grishin calculus LG is the symmetric extension of the non-associative Lambek calculus NL. In this thesis we prove that the derivability problem for LG and the product-free fragment of LG is NP-complete. In the second part of the thesis an implementation of a theorem prover for LG is discussed.
dc.description.sponsorship	Utrecht University
dc.format.extent	370898 bytes
dc.format.mimetype	application/pdf
dc.language.iso	en
dc.title	On the complexity of the Lambek-Grishin calculus
dc.type.content	Master Thesis
dc.rights.accessrights	Open Access
dc.subject.keywords	categorial grammar, Lambek-Grishin calculus, computational linguistics
dc.subject.courseuu	Cognitive Artificial Intelligence