✦ LIBER ✦

The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable

✍ Scribed by Annie Foret

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 465 KB
Volume: 53
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)82576-9

No coin nor oath required. For personal study only.

✦ Synopsis

This paper is concerned with usual decidability questions on grammars for some classes of categorial grammars that arise in the field of learning categorial grammars. We prove that the emptiness of intersection of two langages is an undecidable problem for the following classes : k-valued classical categorial grammars, and k-valued Lambek categorial grammars, for each positive k.