dc.rights.license | CC-BY-NC-ND | |
dc.contributor.advisor | Moortgat, M. | |
dc.contributor.author | Melissen, M. | |
dc.date.accessioned | 2009-09-18T17:03:59Z | |
dc.date.available | 2009-09-18 | |
dc.date.available | 2009-09-18T17:03:59Z | |
dc.date.issued | 2009 | |
dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/3504 | |
dc.description.abstract | In 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.sponsorship | Utrecht University | |
dc.format.extent | 2079939 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | nl | |
dc.title | Lambek–Grishin Calculus Extended to Connectives of Arbitrary Arity | |
dc.type.content | Master Thesis | |
dc.rights.accessrights | Open Access | |
dc.subject.keywords | Formal grammar, Categorial grammar, Lambek-Grishin calculus, Lambek calculus, Non-commutative logic | |
dc.subject.courseuu | Cognitive Artificial Intelligence | |