This paper presents a study into the Hindi-Urdu 'na' as a sentence-final particle. Although also used as a topic marker and negation, 'na' occurs sentence-finally across clause-types. In light of the data, we think the following hypothesis offers the best fit: 'na' signals the speaker’s belief that the content of na’s containing clause is a reasonable inference, given what’s common ground. Notably, in addition to other clause-types, we explore na's distribution in exclamations and exclamatives. We link our work to recent (...) research on the polar question particle 'kya' in Hindi-Urdu. (shrink)

Questions with a quantificational subject have readings that seemingly involve quantification into questions (called ‘QiQ’ for short). In particular, in single-wh questions with a universal quantifier, QiQ-readings call for pair-list answers, similar to pair-list readings of multiple-wh questions. This paper unifies the derivation of QiQ-readings and distinguishes QiQ-readings from pair-list readings of multiple-wh questions. I propose that pair-list multiple-wh questions and QiQ-questions both involve a wh-dependency, namely, that the wh-/quantificational subject stands in a functional dependency with the trace of the (...) wh-object. In particular, in a pair-list multiple-wh question, the wh-subject binds into the trace of the wh-object across an identity operator; in a QiQ-question, the quantificational subject binds into the trace of the wh-object across a predication operator. These operations give rise to distinct definedness requirements, which vary with the quantificational force of the wh-/quantificational subject. The proposed analysis explains a contrast in domain exhaustivity between the pair-list readings of multiple-wh questions and questions with a universal quantifier, while also doing justice to the intuitive similarities between these two types of questions. I further propose that the observed QiQ-effect in a QiQ-question is derived by extracting one of the minimal proposition sets that satisfy the aforementioned quantificational predication condition. The values of these sets determine whether the QiQ-reading is available and whether a QiQ-question admits pair-list answers and/or has a choice flavor. (shrink)