Docs / Studies / Studies.Keenan2026

The Logical Structure of English Quantifiers

Keenan, E. L. (2026). Philosophies, 11(2), 26

Keenan's classes of determiner denotations are invariance classes, each the power set of what it depends on (Det.invariants). The intersective and co-intersective ones generate the conservative ones and are the only ones reducible to a quantification over all individuals. Object quantifiers outrun them: the Boolean functions of accusative individuals are the accusative extensions, a condition that is the two anaphor conditions together. Different students answered different questions is beyond the Frege boundary on an exact range, and (56) has only infinite models, unlike any monadic sentence (FirstOrder.Language.exists_finite_realize).

Implementation notes

The complete Boolean closure is the inductive GenerateCompleteBoolean in place of the stages of (24). A Boolean function of two variables is Prop → Prop → Prop, of which only the four values on truth values matter. diffDiff is the displayed (59), without the condition added in prose that there be at least two members of the restrictor; that case is the first disjunct of reducible_diffDiff_iff. That theorem sharpens Keenan 1992's Example 2, which asks only that both sets have two members: with more members of the restrictor than subsets of the second set the function is constantly false, hence reducible, and its proof's relation witnesses only three pupils. The accusative extension and the two tests for reducibility, stated in that paper, are in Quantifier.Polyadic. Sizes are Set.ncard, as in Quantification/Counting, so the determiners counting with them are meant for finite sets.

TODO

  • Theorem 11's undecidability half, and decidability from the finite model property.
  • The new conservative determiners of Section 2.6 as denotations, beyond (32).
  • (67), and the else-else anaphora of (69) and (70), as functions of relations.

References

Subject quantifiers

L156

Counting

Object quantifiers

The object functions generated from the accusative extensions of the individuals by complements and arbitrary joins are exactly those satisfying the Accusative Extensions Condition. So (41): the denotable objects failing that condition, such as himself, are not Boolean functions of individuals.

theorem generateCompleteBoolean_acc_individual_iffL287–298
{α : Type u_1} {F : (α → α → Prop) → Set α} :

Built from

L323–326
L336–341
L348–354

Beyond the Frege boundary

L373–376
L379–384

Diff-Diff lies beyond the Frege boundary exactly when its restrictor has two members, its second set two members, and there are enough subsets of the second set to tell the members of the restrictor apart. Otherwise it is constant, or the restrictor has two members and the second set one, when it asks whether exactly one of them is related to that member.

theorem reducible_diffDiff_iffL386–461
{α : Type u_1} {A B : Set α} :
Quantifier.Polyadic.Reducible (diffDiff A B) ↔ A.Subsingleton ∨ B.Subsingleton ∨ IsEmpty (↑A ↪ Set ↑B)

Built from

Two-place predicates force infinite models

L492–493
L495–498
L501–507
L509–513