THE GENERALIZED QUANTIFIERS OF NATURAL LANGUAGE ARE PREDICATIVELY DEFINABLE
The Review of Symbolic Logic · 2026-12 · 19 (4) · 635-680
DOI: 10.1017/s1755020326101191 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Review of Symbolic Logic, online erschienen am 25.06.2026. Verfasst von SEAN WALSH. Die Arbeit nennt 66 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
This paper studies the definability of natural language generalized quantifiers. The semantics of generalized quantifiers are provided by a collection of subsets of the underlying domain. However, the generalized quantifiers appearing in natural language are definable either by first-order quantification or by cardinality notions. This paper provides an explanation for this observed phenomenon. The explanation is that the famous constraints of domain independence and conservativity, when extended to Henkin models, suffice to ensure low-level definability, namely Δ 1 1 $\Delta ^1_1$ normal upper Delta 1 Superscript 1 -definability or at least Σ 1 1 $\Sigma ^1_1$ normal upper Sigma 1 Superscript 1 -definability; and in most cases this definability can be made to be bounded. This is basically a consequence of Feferman’s Preservation Theorem [15], which Marker [46] has provided a short model-theoretic proof of. Further, we verify that the paradigmatic cardinality quantifiers are indeed Δ 1 1 $\Delta ^1_1$ normal upper Delta 1 Superscript 1 -definable for a reasonable choice of background theory. Finally, in many other cases, we show that this definability can be lowered to first-order definability.
Zitieren
APA
WALSH, S. (2026). THE GENERALIZED QUANTIFIERS OF NATURAL LANGUAGE ARE PREDICATIVELY DEFINABLE. The Review of Symbolic Logic, 19(4), 635-680. https://doi.org/10.1017/s1755020326101191
Vancouver
WALSH S. THE GENERALIZED QUANTIFIERS OF NATURAL LANGUAGE ARE PREDICATIVELY DEFINABLE. The Review of Symbolic Logic. 2026;19(4):635-680. doi:10.1017/s1755020326101191
BibTeX
@article{WALSH2026,
author = {WALSH, SEAN},
title = {THE GENERALIZED QUANTIFIERS OF NATURAL LANGUAGE ARE PREDICATIVELY DEFINABLE},
journal = {The Review of Symbolic Logic},
year = {2026},
volume = {19},
number = {4},
pages = {635--680},
doi = {10.1017/s1755020326101191}
}
EUVIMED