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
- Keenan 2026, The Logical Structure of English Quantifiers
- Keenan 1992, Beyond the Frege Boundary
- Keenan 1993, Natural Language, Sortal Reducibility and Generalized Quantifiers
- Zuber & Keenan 2019, A Note on Conservativity
- Gaifman 1964, Infinite Boolean Polynomials I
- Hales 1964, On the Non-Existence of Free Complete Boolean Algebras
Subject quantifiers
Theorem 6: the closure of the intersective and co-intersective functions under complements and arbitrary joins is exactly the conservative functions, Keenan 1993's characterization.
A determiner denotation is sortally reducible when its value is its value on the universe at a Boolean function of restrictor and scope, so that it needs no restrictor.
- SortallyReducible d = ∃ (h : Prop → Prop → Prop), ∀ (A B : Set α), d A B ↔ d Set.univ {x : α | h (x ∈ A) (x ∈ B)}
Theorem 7: a conservative function is sortally reducible exactly when it is intersective or co-intersective, so Most poets daydream has no paraphrase quantifying over all individuals.
Built from
Built from
Def. 16a: more ... than C.
- moreThanC C A B = ((A ∩ C).ncard < (A ∩ B).ncard)
Used by conservative_moreThanC, not_asManyAsC_iff
Def. 16b as printed: as many ... as C.
- asManyAsC C A B = ((A ∩ B).ncard ≤ (A ∩ C).ncard)
Used by not_asManyAsC_iff
Built from
Counting
Theorem 4(b): the co-intersective functions are the type ⟨1⟩ quantifiers through the complement of the scope.
- coIntersectiveOrderIso = (Quantifier.Det.invariantsOrderIso ⋯).trans Set.memOrderIso
Object quantifiers
(45), the Accusative Extensions Condition: membership of a in F R depends only on the row of
a in R.
Used by aec_acc, aec_iff_exists_acc, aec_iff_aac_and_isPredicateAnaphor, generateCompleteBoolean_acc_individual_iff, not_aec_self, not_aec_everyButSelf
The Accusative Anaphor Condition: membership of a in F R depends only on a and its row.
Used by aec_iff_aac_and_isPredicateAnaphor, aac_self, aac_everyButSelf, not_aac_moreThan, not_aac_atLeastAsManyAsAnyOther
On a fixed relation, membership of a in F R depends only on the row of a.
- IsPredicateAnaphor F = ∀ (R : α → α → Prop) (a b : α), R a = R b → (a ∈ F R ↔ b ∈ F R)
Used by aec_iff_aac_and_isPredicateAnaphor, isPredicateAnaphor_moreThan, not_isPredicateAnaphor_atLeastAsManyAsAnyOther
Built from
Built from
The Accusative Extensions Condition is the Accusative Anaphor Condition together with Def. 20. So a proper accusative anaphor is never a predicate anaphor.
Built from , ,
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.
Built from
(51a): every ... but himself.
- everyButSelf p R = {a : α | p \ {a} ⊆ {y : α | R a y}}
Used by aac_everyButSelf, not_aec_everyButSelf
Built from ,
Built from ,
(53b): more ... than Ben, comparing the rows of the same relation.
- moreThan b p R = {a : α | ({y : α | R b y} ∩ p).ncard < ({y : α | R a y} ∩ p).ncard}
Built from ,
(55b): at least as many ... as any other student, which entails that its subject is a student.
- atLeastAsManyAsAnyOther s p R = {a : α | a ∈ s ∧ ∀ b ∈ s, b ≠ a → ({y : α | R b y} ∩ p).ncard ≤ ({y : α | R a y} ∩ p).ncard}
Used by not_aac_atLeastAsManyAsAnyOther, not_isPredicateAnaphor_atLeastAsManyAsAnyOther
Built from ,
Built from ,
Beyond the Frege boundary
(59), Different students answered different questions: distinct members of A differ in
what they bear the relation to in B.
- diffDiff A B R = Set.InjOn (fun (a : α) => {y : α | R a y} ∩ B) A
Used by diffDiff_iff_forall_ne, diffDiff_inter_prod, reducible_diffDiff_iff
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.
Built from
Built from
Two-place predicates force infinite models
(56): Everyone likes someone, no two people like the same person, and there is someone that nobody likes, with like the one relation symbol of the language of graphs.
The definition is too large to print here; read it in the source.
Used by realize_everyoneLikesSomeone, infinite_of_realize, realize_succStructure
The relation interpreting the relation symbol.
- like a b = FirstOrder.Language.Structure.RelMap FirstOrder.Language.adj ![a, b]
Used by realize_everyoneLikesSomeone
Built from
The natural numbers with like as is one less than.
The definition is too large to print here; read it in the source.
Built from