Semantics

Donkey Anaphora

When "a donkey" secretly means "every donkey"

Donkey anaphora is the puzzle that "Every farmer who owns a donkey beats it" binds the indefinite a donkey universally — the pronoun it refers to every owned donkey, not just one. Geach (1962) showed this breaks standard predicate logic. Hans Kamp's Discourse Representation Theory (1981) and Irene Heim's File Change Semantics (1982) solved it by abandoning sentence-bound binding for dynamic, discourse-level representations. The donkey puzzle remains the canonical test case for dynamic theories of meaning.

  • CoinedPeter Geach 1962
  • Canonical example"Every farmer who owns a donkey beats it"
  • Two solution familiesDynamic (DRT, FCS) vs E-type
  • DRT founderHans Kamp 1981
  • FCS founderIrene Heim 1982
  • Two readingsStrong (universal) vs weak (existential)

Interactive visualization

Press play, or step through manually. The visualization is yours to drive — try it before reading on.

Open visualization fullscreen ↗

Watch the 60-second explainer

A condensed visual walkthrough — narrated, captioned, under a minute.

The puzzle

Two innocent-looking sentences from Geach (1962):

(1) Every farmer who owns a donkey beats it.
(2) If a farmer owns a donkey, he beats it.

Both are perfectly natural English. Both are interpretable in exactly the way you'd expect: every farmer-donkey pair where the farmer owns the donkey, the farmer beats that donkey. But standard predicate logic, applied compositionally, cannot get this reading.

The problem is that a donkey is a Russellian indefinite — it should translate as ∃y. The smallest scope for that ∃y is the relative clause. So a naive translation of (1) is:

∀x. (FARMER(x) ∧ ∃y. (DONKEY(y) ∧ OWNS(x, y))) → BEATS(x, it)

The pronoun it is supposed to bind to y. But y is trapped inside the existential, which is itself trapped inside the antecedent of a conditional inside a universal. There is no scope path from it back to y. The pronoun is logically unbound.

Yet speakers process (1) and (2) effortlessly with the universal reading: ∀x. ∀y. (FARMER(x) ∧ DONKEY(y) ∧ OWNS(x, y)) → BEATS(x, y). The indefinite has acquired universal force, and the pronoun reaches inside the relative clause to bind the trapped variable.

That gap — between what the standard apparatus predicts and what speakers compute — is the donkey puzzle. It animated semantics from the 1970s onward and produced two of the most influential frameworks in modern formal semantics.

Discourse Representation Theory (Kamp 1981)

Hans Kamp's solution: stop trying to translate sentences into self-contained logical formulas. Translate them incrementally into Discourse Representation Structures (DRSs), boxed records with two parts — a list of discourse referents (entities currently "in play") and a list of conditions on them.

A simple example. "A farmer arrived. He whistled."

┌─────────────────┐
│  x              │
├─────────────────┤
│  farmer(x)      │
│  arrived(x)     │
│  whistled(x)    │
└─────────────────┘

The indefinite introduces discourse referent x; the pronoun retrieves it. No special binding apparatus needed.

For donkey sentences, DRT introduces duplex conditions. The relative-clause donkey sentence (1) becomes:

┌─────────────────────┐    ┌─────────────────┐
│  x, y               │    │                 │
├─────────────────────┤  ⇒ ├─────────────────┤
│  farmer(x)          │    │  beats(x, y)    │
│  donkey(y)          │    │                 │
│  owns(x, y)         │    │                 │
└─────────────────────┘    └─────────────────┘

The duplex condition is read "every assignment to x and y that satisfies the left-hand DRS satisfies the right-hand DRS." This delivers ∀x∀y. The discourse referents introduced by the indefinites (a donkey, a farmer) live inside the universal, and the pronoun in the right-hand DRS finds y by accessibility from the surrounding restrictor.

File Change Semantics (Heim 1982)

Irene Heim, working independently, gave a structurally parallel solution using a different metaphor. A discourse is a file. Each individual gets a file card. Indefinites open new cards; definites and pronouns retrieve old ones.

"A farmer owns a donkey."
   → file: [card 1: farmer; card 2: donkey, owned by 1]

"He beats it."
   → "he" finds card 1 (farmer); "it" finds card 2 (donkey)
   → update card 1: beats card 2

Quantifiers create sub-files; donkey anaphora works because the sub-file's indefinites are accessible to pronouns in the corresponding nuclear-scope sub-file. Like DRT, FCS abandons the requirement that all binding be sentence-internal, replacing it with discourse-level accessibility.

DRT and FCS converge on essentially the same predictions for donkey anaphora — and both are typically grouped under dynamic semantics. Later refinements (Groenendijk and Stokhof's Dynamic Predicate Logic 1991, Beaver's Update Semantics) formalize the dynamic moves directly in terms of context updates.

Donkey-anaphora theories at a glance

DRT (Kamp)FCS (Heim)E-type (Evans)DPL (Groenendijk & Stokhof)
Type of theoryRepresentational dynamicRepresentational dynamicStatic, descriptive proxyDirect dynamic logic
Pronoun isDiscourse referentFile-card lookupHidden definite descriptionBound variable, dynamically
Indefinite isVariable + conditionNew file cardExistential w/ accommodated descriptionDynamic existential
Strong readingDefaultDefaultRequires extra machineryDefault
Weak readingAvailable with relative-clause adjustmentsAvailable with adjustmentsDefaultAvailable
CompositionalityTwo-level (DRT then truth)Two-level (file then truth)One-level, classicalOne-level, dynamic
Empirical coverageWide; classic donkey, modal subordinationWide; same as DRTNarrow; struggles with proportionWide; most parallel to DRT
Foundational textKamp 1981, Kamp & Reyle 1993Heim 1982 dissertationEvans 1977, 1980; Heim 1990Groenendijk & Stokhof 1991

Strong vs weak readings

Donkey sentences are systematically ambiguous between strong and weak readings:

  • Strong (universal): "Every farmer who owns a donkey beats it" = every farmer beats every donkey he owns.
  • Weak (existential): "Every farmer who owns a donkey beats it" = every farmer beats at least one donkey he owns.

Some sentences favor strong, others weak. Kanazawa (1994) and Geurts (2002) survey the data. Compare:

(3) Every farmer who has a credit card uses it.    [favors weak]
(4) Every man who has a quarter puts it in the meter. [favors weak]
(5) Every farmer who owns a donkey beats it.        [favors strong]

The contrast tracks the predicate's plausibility profile: a person with multiple credit cards typically uses some of them, not all; a farmer with multiple donkeys plausibly beats all of them. The strong/weak ambiguity is genuine and remains theory-resistant.

Cross-linguistic variation

  • English / German / Dutch / French. Standard donkey readings as described.
  • Mandarin. Cheng and Huang (1996) — Mandarin uses bare wh-words ("wh-conditionals") where English uses indefinites: 谁先来谁先吃 shéi xiān lái shéi xiān chī ("whoever comes first eats first"). The bare wh has the same dual life as English indefinites in donkey contexts.
  • Japanese. Bare nouns and the wh-mo construction (誰でも dare-mo "anyone") handle donkey-like contexts. Nishigauchi (1990) gives a detailed treatment.
  • Hindi. Conditional-correlative constructions (jo... vo) explicitly mark the donkey relation: jo kisaan ke paas gadhaa hai vo use peeTtaa hai "the farmer who has a donkey, he beats it."
  • Tlingit and other languages with overt switch-reference. Some show explicit grammatical marking of the antecedent-anaphor link, providing morphological evidence for dynamic-style accessibility.

Roberts (1989) showed that the same dynamic mechanism handles modal subordination:

A wolf might walk in. It would eat me first.

The pronoun it in the second sentence cannot pick up the wolf if "a wolf might walk in" is read with narrow-scope existential — there is no actual wolf to refer to. Yet the pronoun works. Dynamic semantics handles this by letting the modal operator (might) license a temporary discourse referent that subsequent modal sentences (would) can access. DRT extends naturally to model this and other long-distance binding phenomena.

Related phenomena

  • Bishop sentences. "If a bishop meets a bishop, he blesses him" — two indefinites, two pronouns. Tests the symmetry of dynamic binding (Heim 1990, Elbourne 2005).
  • Sage-plant sentences. "Everyone who bought a sage plant from Mary's nursery thinks it will outlast the year" (Heim 1982) — singular indefinite, plural reference; tests the genericity-individuation interface.
  • Telescoping. "Every chess set comes with a spare pawn. They are all kept in a separate box." The plural they picks up the kind, not the individuals — argues for kind-referring discourse referents.
  • Paycheck sentences. "The man who gave his paycheck to his wife is wiser than the man who gave it to his mistress" (Karttunen 1969) — "it" is a paycheck-of-some-other-man. Treated as E-type lookalike or as a special form of dynamic binding.

Common pitfalls

  • Treating the donkey indefinite as a true universal. It's an indefinite that acquires universal force from the surrounding quantifier — its lexical meaning is still existential.
  • Ignoring the strong/weak ambiguity. Sentences with credit cards, quarters, light switches favor weak; sentences with donkeys, mistakes, books favor strong. The choice is a real empirical fact.
  • Conflating DRT with FCS. They make near-identical predictions but use different formal apparatus; cross-citing their predictions without flagging the framework hides where they actually differ.
  • Assuming E-type theories are dead. They handle some cases (paycheck sentences) more naturally than dynamic theories. Modern E-type theories (Elbourne 2005) are still active.
  • Reading dynamic semantics as a representational claim. Some versions are; others (like DPL) treat dynamics as a property of the logic, not a mental representation.
  • Forgetting the conditional version. "If a farmer owns a donkey, he beats it" is a donkey sentence too — without the relative clause. Both relative-clause and conditional donkey sentences need to be covered by any complete theory.

Frequently asked questions

Why is it called "donkey" anaphora?

Peter Geach's 1962 example sentence — "Every farmer who owns a donkey beats it" — became the canonical case. Geach was building on a medieval debate about insolubilia and the same example pattern recurs in Walter Burley and other 14th-century logicians. Geach used donkeys; the term stuck. The general phenomenon would more accurately be called "indefinite-pronoun binding across scope boundaries," but "donkey anaphora" is universal jargon now.

What's the puzzle, exactly?

Standard semantics gives indefinites existential force ("a donkey" = ∃x. DONKEY(x)). The standard scope of an existential is the smallest clause it appears in. So "Every farmer who owns a donkey beats it" should mean: ∀x. (FARMER(x) ∧ ∃y. DONKEY(y) ∧ OWNS(x, y)) → BEATS(x, it). The pronoun "it" has nowhere to bind — y is trapped inside the existential's scope. Yet the sentence is interpretable and means roughly: ∀x. ∀y. (FARMER(x) ∧ DONKEY(y) ∧ OWNS(x, y)) → BEATS(x, y). The indefinite gets universal force, and the pronoun reaches inside the relative clause.

What is Discourse Representation Theory?

Hans Kamp's (1981) framework. Sentences are translated incrementally into Discourse Representation Structures (DRSs), boxed structures with discourse referents and conditions. Indefinites introduce new discourse referents into the current DRS; pronouns find an antecedent referent already in scope. Quantifiers create sub-DRSs with accessibility relations. "Every farmer who owns a donkey beats it" becomes a duplex condition: a restrictor DRS [farmer x, donkey y, x owns y] and a nuclear scope DRS [x beats y], read as ∀x∀y. (restrictor) → (scope).

What is File Change Semantics?

Irene Heim's (1982) parallel framework, developed independently of Kamp. Discourse is a file with index-cards ("file cards") for each entity. Indefinites open new cards; definites and pronouns retrieve old ones. Quantifiers create sub-files. The two systems make almost identical predictions for donkey anaphora — Heim and Kamp converged on dynamic discourse-level binding. Heim's 1982 dissertation is the more readable introduction; Kamp and Reyle's 1993 textbook From Discourse to Logic is the comprehensive DRT reference.

What are the strong and weak readings?

Donkey sentences have two possible readings. Strong (universal): "Every farmer who owns a donkey beats it" = every farmer beats every donkey he owns. Weak (existential): a farmer beats at least one donkey he owns. The relative-clause version (above) is naturally read as strong; conditionals ("If a farmer owns a donkey, he beats it") allow both. Kanazawa (1994) and Geurts (2002) survey the empirical landscape; ambiguity is genuine and theory-resistant.

How do E-type theories handle donkey sentences?

Gareth Evans (1977, 1980) proposed that donkey pronouns are "E-type" — they go proxy for a definite description recovered from the antecedent. "Every farmer who owns a donkey beats it" becomes "every farmer who owns a donkey beats the donkey he owns." Heim (1990) and Elbourne (2005) develop technical implementations. E-type theories sidestep dynamic binding but face the proportion problem (Kanazawa 1994): they predict only weak readings unless additional machinery is added. Dynamic and E-type approaches remain rival families.