Lara's Term Paper

Introduction to Quantifiers

The following e-learning material provides an introduction to the topic of quantifiers by integrating examples, illustrations as well as different types of interactive exercises of varying difficulty and their solutions. It intends to cover the central ideas of the concept of quantifiers without too much formal logic and therefore provides a basis for further study.

Author: Lara

(Back to the Group Overview or Hauptseminar: "New Media in Teaching Semantics")

Wiki pages

Definition

A ‘quantifier’ is a word like many, few, little, several, which is used in a noun phrase to indicate the quantity of something.

In logic, quantifiers are operators binding variables, which means that a quantifier connects parts of a sentence that classify a domain of discourse.

Individual variables are written as “x” and can refer to any individual.

Different Types of Quantifiers

There are different types of quantifiers which can be divided in:

• Logical quantifiers
  • Universal quantifier
  • Existential quantifier
• Restricted quantifiers

In predicate logic the two fundamental quantifiers are the logical quantifiers (also called generalized quantifiers), which are the universal quantifier and the existential quantifier.

Logical Quantifiers (Generalized Quantifiers)

T A B E L L E

The Universal Quantifier ∀

• The universal quantifier is used to mean that the statement is true for every entity in the domain in question.
• symbolized by the operator ∀
• conveyed by such expressions as all, every and each
• The sequence “∀x” is read as
  • “For every thing x”
  • “For any value of x”
  • “For all values of x”
  • “Whatever x may be”

EXAMPLES

The following examples show quantified sentences translated into predicate logic formulae.

Every dog is barking.

∀x (DOG (x) → BARK (x))

“For every thing x, if x is a dog then x is barking.”

All students were tired.

∀x (STUDENT (x) → TIRED (x))

“For every thing x, if x is a student then x is tired.”

NOCH EIN BEISPIEL

NOCH EIN BEISPIEL

Negation:

No trains are late.

Wherever you put an x, this statement does not hold:

∀x ~ (TRAIN (x) → LATE (x))

“It is not the case that for all x, if x is a train then x is late.”

Or equivalently, we can use the existential quantifier (see below) and say:

There is no x for which this statement would hold:

~ ∃x (TRAIN (x) & LATE (x))

“There is no x such that x is a train and x is late.”

The Existential Quantifier ∃

• The existential quantifier is used to mean that the statement is true of at least one entity in the domain.
• symbolized by the operator ∃
• stands for expressions with a/an (one), some and there is
• The sequence “∃x” is read as
  • “There is an x”
  • “There is at least one thing x”

Negation:

• The special case of the determiner no(ne) is analyzed with ∃ and negation.
• The sequence “~∃x” (same as “¬∃x”) is read as
  • “There is no x”

EXAMPLES

The following examples show quantified sentences translated into predicate logic formulae.

A dog barked.

∃x (DOG (x) & BARK (x))

“There is at least one thing x such that x is a dog and x barked.”

Anna bought some trashy paperbacks.

∃x (PAPERBACK (x) & TRASHY (x) & BUY (Anna, x))

∃x (PAPERBACK (x) & TRASHY (x) & BUY (a, x))

Note: In the second formula the variable a stands for ‘Anna’. Both of the writings are correct.

“There is an x such that x is a paperback and x is trashy and x is bought by Anna.”

Negation:

No trains are late.

There is no x for which this statement would hold:

~ ∃x (TRAIN (x) & LATE (x))

“There is no x such that x is a train and x is late.”

Or equivalently, we can use the universal quantifier (see above) and say:

Wherever you put an x, this statement does not hold:

∀x ~ (TRAIN (x) → LATE (x))

“It is not the case that for all x, if x is a train then x is late.”

There is no antidote to cyanide.

~ ∃x (ANTIDOTE (x, c))

„It is not the case that there is an x such that x is an antidote to cyanide.“ or „There is no x such that x is an antidote to cyanide.“

Clive ate nothing.

~ ∃x (EAT (c, x))

„There is no x such that Clive ate x.“

Clive didn’t eat one thing.

∃x ~ (EAT (c, x))

„There is at least one thing x such that Clive didn’t eat x.“

The Restricted Quantifiers

In contrast to the logical quantifiers …

• a restricted quantifier always has a reference quantity and therefore points out a proportion of a set and not the proportion of everything there is.
• Since common natural language quantifiers like most, few, many or several cannot be analyzed like the logical quantifiers in the standard form of the predicate calculus, they are expressed in the notation of restricted quantification.
• Sentences which contain restricted quantifiers are written with square brackets. This means that the noun phrase including the quantifier is always put into square brackets. Logical quantifiers can also be written in this kind of formula with square brackets.
• Examples: a few – some – several – many – most – all – every – a – a number – one/two/three – little – no – no one – someone

EXAMPLES

Several cars crashed.

[Several x: CAR (x)] CRASH (x)

Maria peeled and quartered three apples.

[Three x: APPLE (x)] PEEL (m, x) & QUARTER (m, x)

Morris showed Jane every fingerprint he dusted.

[Every x: FINGERPRINT (x) & DUST (m, x)] SHOW (m, x, j)

Most travellers entering or leaving Australia visit Sydney.

[Most x: TRAVELLER (x) & (ENTER (x, a) or LEAVE (x, a))] VISIT (x, s)

[Most x: TRAVELLER (x) & (ENTER (x, a) V LEAVE (x, a))] VISIT (x, s)

Note: In the second formula the logical operator V means ‘or’. Both writings are correct.

Negation:

No dogs barked.

[No x: DOG (x)] BARK (x)

Glossary entries

Links to additionally created glossary entries

Online excercises

Links to additionally created online exercises