Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorMoortgat, M.
dc.contributor.authorMelissen, M.
dc.date.accessioned2009-09-18T17:03:59Z
dc.date.available2009-09-18
dc.date.available2009-09-18T17:03:59Z
dc.date.issued2009
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/3504
dc.description.abstractIn my thesis, I introduce the generalized Lambek–Grishin calculus and study its properties. The second part of this thesis studies the Lambek calculus and the Lambek–Grishin calculus from the perspective of formal language theory. The main result is a new lower-bound on the generative complexity of the Lambek–Grishin calculus.
dc.description.sponsorshipUtrecht University
dc.format.extent2079939 bytes
dc.format.mimetypeapplication/pdf
dc.language.isonl
dc.titleLambek–Grishin Calculus Extended to Connectives of Arbitrary Arity
dc.type.contentMaster Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordsFormal grammar, Categorial grammar, Lambek-Grishin calculus, Lambek calculus, Non-commutative logic
dc.subject.courseuuCognitive Artificial Intelligence


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record