nLab
generalized quantifier

Contents

Idea

Generalized quantifiers were introduced into model theory by the Polish logician A. Mostowski in order to supplement the usual existential and universal quantifiers of first-order predicate logic with the aim to circumvent shortcomings concerning expressivity and categoricity.

Their use for the semantic analysis of natural language determiners in the footsteps of Richard Montague revolutionized linguistics in the early 1970s.

Definition

Definition

A generalized quantifier or an interpretation of a quantifier symbol QQ is a mapping μ Q\mu_Q from triples of cardinal numbers 𝔪,𝔫,𝔭\langle \mathfrak{m},\mathfrak{n},\mathfrak{p}\rangle such that 𝔪+𝔫=𝔭\mathfrak{m}+\mathfrak{n}=\mathfrak{p} to Ω={0,1}\Omega=\{0,1\}. The satisfaction relation for QQ is defined for structures 𝔄\mathfrak{A} with carrier AA and valuation xx by

𝔄 x(Qv n)ϕ iffμ Q(𝔪,𝔫,𝔭)=1,with 𝔪 =card({aA:𝔄 x(n/a)ϕ}) 𝔫 =card({aA:𝔄 x(n/a)¬ϕ}) 𝔭 =card(A). \begin{aligned} \mathfrak{A}\models_x(Qv_n)\phi\quad&{iff}\quad \mu_Q(\mathfrak{m},\mathfrak{n},\mathfrak{p})=1\;,\; with \\ \mathfrak{m}&=card(\{a\in A:\mathfrak{A}\models_{x(n/a)}\phi\}) \\ \mathfrak{n}&=card(\{a\in A:\mathfrak{A}\models_{x(n/a)}\not\phi\}) \\ \mathfrak{p}&=card(A)\;. \end{aligned}

Examples

  • The universal quantifier \forall has μ (𝔪,𝔫,𝔭)=1\mu_\forall(\mathfrak{m},\mathfrak{n},\mathfrak{p})=1 iff 𝔫=0\mathfrak{n}=0.

  • The quantifier Q αQ_\alpha “there exist at least α\aleph_\alpha” is given by μ Q α(𝔪,𝔫,𝔭)=1\mu_{Q_\alpha}(\mathfrak{m},\mathfrak{n},\mathfrak{p})=1 iff 𝔪 α\mathfrak{m}\geq\aleph_{\alpha}\;.

  • The quantifier W\mathsf{W} “most” is given by μ W(𝔪,𝔫,𝔭)=1\mu_{\mathsf{W}}(\mathfrak{m},\mathfrak{n},\mathfrak{p})=1 iff 𝔪>𝔫\mathfrak{m}>\mathfrak{n}\;. Note that this uses the second variable as well, whereas \forall or Q αQ_\alpha depend only on card({aA:𝔄 x(n/a)ϕ})card(\{a\in A:\mathfrak{A}\models_{x(n/a)}\phi\}).

References

Generalized quantifiers were introduced in

  • A. Mostowski, On a Generalization of Quantifiers , Fund. Math. 44 (1957). (pdf)

An early textbook account is in ch.13 of

  • J. L. Bell, A. B. Slomson, Models and Ultraproducts: An Introduction , North-Holland Amsterdam 1969. (Dover reprint)

Several chapters treat their model-theoretic role in

  • J. Barwise, S. Feferman (eds.), Model-theoretic Logics , Springer Heidelberg 1985 (freely available online: toc) .

In the context of Martin-Löf type theory they are discussed by

  • G. Sundholm, Constructive Generalized Quantifiers , Synthese 79 no.1 (1989) pp.1-12.

For the use of generalized quantifiers in natural language semantics see

  • J. Barwise, R. Cooper, Generalized Quantifiers and Natural Language , Linguistics and Philosophy 4 no.2 (1981) pp.159-219.

  • E. Keenan, J. Stavi, A semantic characterization of natural language determiners , Linguistics & Philosophy 9 (1986) pp.253–326.

  • D. Westerståhl, Generalized quantifiers: linguistics meets model theory , in Aloni, Dekker (eds.), The Cambridge Handbook of Semantics , Cambridge UP 2014. (draft)

Some problems with the standard approach in linguistics are discussed in

  • H. Ben-Yami, Generalized Quantifiers, and Beyond , Logique Et Analyse no.208 (2009) pp.309-326.

  • M. Hackl, On the Grammar and Processing of Proportional Quantifiers: Most Versus More Than Half , Natural Language Semantics 17 no.1 (2009) pp.63-98.

A dependent type theoretic analysis of natural language generalized quantifiers is in

  • T. Fernando, Conservative generalized quantifiers and presupposition , Semantics and Linguistic Theory XI (2001) pp.172–91. (draft)

Last revised on June 14, 2018 at 09:39:48. See the history of this page for a list of all contributions to it.