Autor:	Grudzinska, Justyna, Zawadowski, Marek
Rok vydání:	2014
Předmět:	Mathematics - Logic Computer Science - Logic in Computer Science 03B65 91F20
Druh dokumentu:	Working Paper
Popis:	We propose a system for the interpretation of anaphoric relationships between unbound pronouns and quantifiers. The main technical contribution of our proposal consists in combining generalized quantifiers with dependent types. Empirically, our system allows a uniform treatment of all types of unbound anaphora, including the notoriously difficult cases such as quantificational subordination, cumulative and branching continuations, and 'donkey anaphora'. Comment: 40 pages; final version
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1402.0033 Zobrazit plný text záznamu View this record from Arxiv