Docs / Studies / Studies.Chatain2025

Reducing pronoun accessibility to presupposition satisfaction

Chatain, K. (2025). Journal of Semantics, 42(3), 239–280

A discourse pronoun denotes the pick of a choice function from a witness set and is undefined where the set is empty (pro), and an indexed indefinite asserts that its witness set is nonempty (antecedent), so a pronoun is accessible where an existence presupposition is satisfied. Under Middle Kleene connectives and universally projecting determiners the presupposition is filtered after the antecedent, in a bathroom disjunction and in a donkey sentence, and projects when the pronoun comes first. Quantifying over the choice function gives the universal and existential readings, and restricting the witness set to the local context of its indefinite gives the subordination constraint.

Implementation notes

A point of evaluation S is a world, or a world with an assignment once binders are present, and a binder is the family b : α → S of points at which its variable takes each value. The constraint on indexing fixes the witness set of an indefinite's index, so the definitions take a witness set and a choice function rather than an index (forall_isExpressive_iff). The paper's examples are the rows of Data.Examples.Chatain2025.

TODO

  • The constraint on choice-function variation, which bars a choice function from varying with a binder that its witness set is constant in, and the expressivity constraint weakened to match are not formalized: IsExpressive and the two readings quantify over unrestricted families.

References

Pronouns and their antecedents

L50–53
L55–58
L61–65

Filtering by the connectives

The pronoun's presupposition is filtered after its antecedent (there is a phone-book and it is in the cabinet) and by a but that filters in both directions; it projects when the pronoun comes first, where the antecedent is then redundant; and after a negated antecedent the conjunction is defined only where it is false.

Pronouns under quantifiers

Determiners are read by universal projection (Quantifier.Det.universalProjection): undefined unless the scope is defined wherever the restrictor is true.

Every tourist who bought a ticket has already used it: the indefinite in the restrictor filters the presupposition of the pronoun in the scope, whatever the determiner.

theorem universalProjection_antecedent_clause_ne_undefinedL160–166
{α : Type u_2} {S : Type u_3} {E : Type u_4} {G : S → Set E} {f : S → ChoiceFunction E} {VP : S → E → Prop} {Q : Quantifier.Det α} {p : α → Trivalent} {b : α → S} :
(Q.universalProjection (fun (y : α) => min (p y) (antecedent G (b y))) fun (y : α) => clause G f VP (b y)) ≠ Trivalent.undefined

Built from ,

L168–176

The universal rule is below deployment: for a determiner that lives on its restrictor, universal projection has the deployed value wherever it is defined, so a presupposition satisfied under the universal rule is satisfied under deployment.

theorem universalProjection_kLE_deployQuantifierL178–183

Existential and universal readings

Quantifying universally over the choice function gives the universal reading of a conjunction and of a donkey sentence, and quantifying existentially the existential one.

Existential quantification over the choice function gives the existential reading of a donkey sentence. The choice function varies with the point of evaluation, so each value of the bound variable gets its own pick.

theorem exists_donkey_eq_true_iffL223–238
{α : Type u_2} {S : Type u_3} {E : Type u_4} {G : S → Set E} {VP : S → E → Prop} {p : α → Trivalent} {b : α → S} [Nonempty E] :
(∃ (f : S → ChoiceFunction E), (Quantifier.Det.every.universalProjection (fun (y : α) => min (p y) (antecedent G (b y))) fun (y : α) => clause G f VP (b y)) = Trivalent.true) ↔ ∀ (y : α), p y = Trivalent.true → (G (b y)).Nonempty → ∃ x ∈ G (b y), VP (b y) x

Built from ,

Indices

The subordination constraint

With the witness set restricted to the local context of its indefinite, a pronoun under a second quantifier presupposes that the second restrictor lies within the first (every tourist bought a ticket. # Most locals have already used it).

L276–278

Every tourist bought a ticket. # Most locals have already used it: when the witness set is restricted to the local context that the first quantifier gives its scope, the pronoun under a second quantifier is defined only where the second restrictor lies within the first.

theorem subordination_constraintL285–297
{E : Type u_4} {W : Type u_5} [Finite E] {q : Quantifier.NumberTree} {A : W → Set E} {C : Set W} {R : Set (W × E)} (hR : Presupposition.IsLocalContext C {Presupposition.scopeTruth q A} R) {G : W × E → Set E} {f : W × E → ChoiceFunction E} {VP : W × E → E → Prop} {Q : Quantifier.Det E} {p : E → Trivalent} {w : W} (h : (Q.universalProjection p fun (y : E) => clause (restrict R G) f VP (w, y)) ≠ Trivalent.undefined) {y : E} (hy : p y = Trivalent.true) :
y ∈ A w

Built from ,