Exhaustification, free-choice, and additivity

Evidence from Sakha da(γanɨ)

Datos Bibliográficos

ID22159592
AutoresIan L Kirby (Harvard University Press, autor de correspondencia), Ian Kirby
Año2021
Volumen6
Número1
Páginas663
Fecha de publicación2021-03-20
Peer ReviewedSí
Open AccessSí
TipoARTICLE
RevistaProceedings of the Linguistic Society of America (JOURNAL)
Identificadores de la revistaISSN: 2473-8689 • E-ISSN: 2473-8689
EditorialLinguistic Society of America (PUBLISHER • US)
DOI10.3765/plsa.v6i1.5005
OpenAlexW3137804588
IdiomaEN
Referencias citadas10

This paper discusses some unique semantic properties displayed by the Sakha quantifier particle daγanɨ (often reduced to da). It is shown that, despite significant similarity with well-studied additive TOO-particles such as Japanese -mo and Hungarian -is, da(γanɨ) never clearly serves the role of additive too/also/either, nor does it appear in free-choice items. Adopting an exhaustification-based approach wherein quantifier particles activate grammatical alternatives which are in turn interpreted by covert operators O(nly) or E(ven), it is proposed that da(γanɨ)-marked phrases are typically exhaustified non-recursively

Additive function · Arithmetic · Covert · Linguistics · Mathematical analysis · Computer Science · Mathematics · Natural Language Processing Techniques · Philosophy · Syntax, Semantics, Linguistic Variation