Generalized quantifier

In linguistic semantics, a generalized quantifier is an expression that denotes a property of a property, also called a higher-order property. This is the standard semantics assigned to quantified noun phrases, also called determiner phrases, in short: DP. The DP every boy below says of a property X that the set of entities that are boys is a subset of the set of entities that have property X. So the following sentence says that the set of boys is a subset of the set of sleepers.

Every boy sleeps.
<math>\\{x\,|\, x \mbox{ is a boy}\\} \subseteq \\{x\,|\,x \mbox{ sleeps}\\}</math>

This treatment of quantifiers has been essential in achieving a compositional semantics for sentences containing quantifiers.[1][2]

## Contents

* 1 Type theory
* 2 The typed lambda calculus
* 3 Properties of generalized quantifiers
* 3.1 Monotonicity
* 3.1.1 Monotone increasing GQs
* 3.1.2 Monotone decreasing GQs
* 3.1.3 Non-monotone GQs
* 3.2 Conservativity
* 4 See Also
* 5 References

## Type theory

[edit | edit source]

A version of type theory is often used to make the semantics of different kinds of expressions explicit. The standard construction defines the set of types recursively as follows:

1. e and t are types.
2. If a and b are both types, then so is <math>\langle a,b\rangle</math>
3. Nothing is a type, except what can be constructed on the basis of lines 1 and 2 above.

Given this definition, we have the simple types e and t, but also a countable infinity of complex types, some of which include:

<math>\langle e,t\rangle;\qquad \langle t,t\rangle;\qquad \langle\langle e,t\rangle, t\rangle; \qquad\langle e,\langle e,t\rangle\rangle; \qquad \langle\langle e,t\rangle,\langle \langle e, t\rangle, t\rangle\rangle;\qquad \ldots</math>

* Expressions of type e denote elements of the universe of discourse, the set of entities the discourse is about. This set is usually written as <math>D_e</math>. Examples of type e expressions include John and he.
* Expressions of type t denote a truth value, usually rendered as the set<math>\\{0,1\\}</math>, where 0 stands for "false" and 1 stands for "true". Examples of expressions that are sometimes said to be of type t are sentences or propositions.
* Expressions of type <math>\langle e,t\rangle</math> denote functions from the set of entities to the set of truth values. This set of functions is rendered as <math>D_t^{D_e}</math>. Such functions are characteristic functions of sets. They map every individual that is an element of the set to "true", and everything else to "false." It is common to say that they denote sets rather than characteristic functions, although, strictly speaking, the latter is more accurate. Examples of expressions of this type are predicates, nouns and some kinds of adjectives.
* In general, expressions of complex types <math>\langle a,b\rangle</math> denote functions from the set of entities of type <math>a</math> to the set of entities of type <math>b</math>, a construct we can write as follows: <math>D_b^{D_a}</math>.

We can now assign types to the words in our sentence above (Every boy sleeps) as follows.

*     * Type(boy)=<math>\langle e,t\rangle</math>
* Type(sleeps)=<math>\langle e,t\rangle</math>
* Type(every)= <math>\langle\langle e,t\rangle,\langle \langle e, t\rangle, t\rangle\rangle</math>

Thus, every denotes a function from a set to a function from a set to a truth value. Put differently, it denotes a function from a set to a set of sets. It is that function which for any two sets A,B, every(A)(B)= 1 if and only if <math>A\subseteq B</math>.

## The typed lambda calculus

[edit | edit source]

A useful way to write complex functions is the lambda calculus. For example, one can write the meaning of sleeps as the following lambda expression, which is a function from an individual x to the proposition that x sleeps.

<math>\lambda x. sleep(x)</math>

Such lambda terms are functions whose domain is what precedes the period, and whose range are the type of thing that follows the period. If x is a variable that ranges over elements of <math>D_e</math>, then the following lambda term denotes the identity function on individuals:

<math>\lambda x.x</math>

We can now write the meaning of every with the following lambda term, where X,Y are variables of type <math>\langle e,t\rangle</math>:

<math>\lambda X.\lambda Y. X\subseteq Y</math>

If we abbreviate the meaning of boy and sleeps as "B" and "S", respectively, we have that the sentence every boy sleeps now means the following:

<math>(\lambda X.\lambda Y. X\subseteq Y)(B)(S)</math> — β-reduction
<math>(\lambda Y. B \subseteq Y)(S)</math> — β-reduction
<math>B\subseteq S</math>

The expression every is a determiner. Combined with a noun, it yields a generalized quantifier of type <math>\langle\langle e,t\rangle,t\rangle</math>.

## Properties of generalized quantifiers

[edit | edit source]

### Monotonicity

[edit | edit source]

#### Monotone increasing GQs

[edit | edit source]

A generalized quantifier GQ is said to be monotone increasing, also called upward entailing, just in case, for any two sets X and Y the following holds:

if <math>X\subseteq Y</math>, then GQ(X) entails GQ(Y).

The GQ every boy is monotone increasing. For example, the set of things that run fast is a subset of the set of things that run. Therefore, the first sentence below entails the second:

1. Every boy runs fast.
2. Every boy runs.

#### Monotone decreasing GQs

[edit | edit source]

A GQ is said to me monotone decreasing, also called downward entailing just in case, for any two sets X and Y, the following holds:

If <math>X\subseteq Y</math>, then GQ(Y) entails GQ(X).

An example of a monotone decreasing GQ is no boy. For this GQ we have that the first sentence below entails the second.

1. No boy runs.
2. No boy runs fast.

The lambda term for the determiner no is the following. It says that the two sets have an empty intersection.

<math>\lambda X.\lambda Y. X\cap Y= \emptyset</math>

Monotone decreasing GQs are among the expressions that can license a negative polarity item, such as any. Monotone increasing GQs do not license negative polarity items.

1. Good: No boy has any money.
2. Bad: *Every boy has any money.

#### Non-monotone GQs

[edit | edit source]

A GQ is said to be non-monotone if it is neither monotone increasing nor monotone decreasing. An example of such a GQ is exactly three boys. Neither of the following two sentences entail the other.

1. Exactly three students ran.
2. Exactly three students ran fast.

The first sentence doesn't entail the second. The fact that the number of students that ran is exactly three doesn't entail that each of these students ran fast, so the number of students that did that can be smaller than 3. Conversely, the second sentence doesn't entail the first. The sentence exactly three students ran fast can be true, even though the number of students who merely ran (i.e. not so fast) is greater than 3.

The lambda term for the (complex) determiner exactly three is the following. It says that the cardinality of the intersection between the two sets equals 3.

<math>\lambda X.\lambda Y. |X\cap Y|=3</math>

This would represent the first assertion above, where X means the set of people that are students, and Y the set of people that ran. The second sentence would be written similarly using an apparently equivalent lambda-expression

<math>\lambda X.\lambda Z. |X\cap Z|=3</math>

where Z means the set of people that ran fast.

Although we have Y included in Z neither of the two assertions can be entailed from the other, because there's no free variable in the first expression that could be be interpreted as having the same meaning in the second instance of the same lambda-expression, because they are bound to distinct sets (the set of people that ran, and the distinct set of people thatran fast could be both bound separately and indepdantly to the first of second lambda-expression without implying anything about the entailment of either one of the two generated instances in the second one).

For such entailment to be possible, the rebindings of quantified (non-free) variables into effective sets (free variables) must be done identically in all instances. If this is not the case, the quantified (non-free) variables must be renamed so that one create a new assertion stating the entailment of one lamda-expression into the other, with those explicit bindings such as:

<math>\lambda X.\lambda Y.\lambda Z. |X\cap Y|=3 \subseteq |X\cap Z|=3</math>
<math>\lambda X.\lambda Y.\lambda Z. |X\cap Z|=3 \subseteq |X\cap Y|=3</math>

which can't be entailed from any of the two above statements because it attempts to bind the same non-free variable X to both statements. The only correct way to explicit the combination of the two statements above as a single assertion is to rename all quantified (non-free) variables so that they don't conflict within the two instances:

<math>\lambda X_0.\lambda Y_0. |X_0\cap Y_0|=3</math> and
<math>\lambda X_1.\lambda Y_1. |X_1\cap Y_1|=3</math>

and then create the compound assertion:

<math>(\lambda X_0.\lambda Y_0. |X_0\cap Y_0|=3) \and (\lambda X_1.\lambda Y_1. |X_1\cap Y_1|=3)</math>

which can now safely be reordered with all lambda quantifiers factorized at the begining (because these quantifiers are commutative and associative providing that there's no modified binding to their existing variables):

<math>\lambda X_0.\lambda Y_0.\lambda X_1.\lambda Y_1. (|X_0\cap Y_0|=3) \and (|X_1\cap Y_1|=3)</math>

and then bind their associated sets according to each instance:

<math>\lambda X.\lambda Y.\lambda X.\lambda Z. (|X\cap Y|=3) \and (|X\cap Z|=3)</math>

which finally reduces as:

<math>\lambda X.\lambda Y.\lambda Z. (|X\cap Y|=3) \and (|X\cap Z|=3)</math>

because two equal quantifiers reduce to a single equivalent one. As there's no derivation between this last statement and the first two statements, even if we also try to include that fact that we also know that Y includes Z (a third statement to the first two ones):

<math>\lambda X.\lambda Y.\lambda Z. (|X\cap Y|=3) \and (|X\cap Z|=3) \and (Y \subseteq Z)</math>

### Conservativity

[edit | edit source]

A determiner D is said to be conservative if the following equivalence holds:

<math>D(A)(B)\leftrightarrow D(A)(A\cap B)</math>

For example, the following two sentences are equivalent.

1. Every boy sleeps.
2. Every boy is a boy who sleeps.

It has been proposed that all natural language determiners (i.e. in every language) are conservative (Barwise and Cooper 1981). The expression only is not conservative. The following two sentences are not equivalent. But it is, in fact not common to analyze only as a determiner. Rather, it is standardly treated as a focus-sensitive adverb.

1. Only boys sleep.
2. Only boys are boys who sleep.

## See Also

[edit | edit source]

* Lindström quantifier

## References

[edit | edit source]

1. ↑ Montague, Richard: 1974, 'The proper treatment of quantification in English', in R. Montague, Formal Philosophy, ed. by R. Thomason (New Haven).
2. ↑ Barwise, Jon and Robin Cooper. 1981. Generalized quantifiers and natural language. Linguistics and Philosophy 4: 159-219.

Template:WikiDoc Sources