Documentation

Linglib.Semantics.Quantification.Generic

Generic quantifiers as generalized-quantifier schemas #

Rival semantics for the silent generic operator Gen, expressed as instances of the existing Quantification.GQ α generalized-quantifier interface ([BC81]) rather than as bespoke per-paper types. The competing theories then differ by a property of the GQ, not by an incompatible signature: all are Conservative; only the majority schema is Proportional.

The third schema, the majority/absolute-reading operator ([Coh99]), is the existing Quantification.most_sem; most_proportional records that it — alone among the three — is Proportional (its truth is a function of the |R ∩ S| : |R ∖ S| ratio). That is the precise "generics as majority quantification" characterization the genericity literature ([Nic09], [Les08]) rejects as a theory of generics; it is true of this operator, not of generics in general.

The per-paper operators are shown EQUAL to these schemas in the study files (Cohen1999.cohenGEN_univ_eq_most_sem, Nickel2009.nickelGEN_univ_eq_genWays), so the unification subsumes them rather than paralleling them. Those bridges are to the operators as linglib formalizes them, inheriting their documented simplifications (Cohen's cohenGEN is the absolute reading only; genWays takes Nickel's modal "ways" at their actual extension).

Main definitions #

Main results #

Implementation notes #

GQ α is whole-carrier (Fintype); the study operators take an explicit Finset domain and bridge at Finset.univ. most_sem/Proportional are stated over the noncomputable classical count, so the proportionality contrast is witnessed by a decidable cardinality example rather than a Proportional counterexample.

The generic schemas as generalized quantifiers #

def Quantification.genNormalcy {α : Type u_1} [Fintype α] (normal : αProp) :
GQ α

Traditional Gen ([KPC+95]) as a generalized quantifier: the restrictor's NORMAL members all satisfy the scope — a normalcy-restricted universal, i.e. Gen with a hidden normalcy parameter.

Equations
Instances For
    def Quantification.genWays {α : Type u_1} [Fintype α] {ι : Type u_2} (normalIn : αιProp) (ways : Finset ι) :
    GQ α

    [Nic09]'s ways-of-normality Gen as a generalized quantifier: SOME way of being normal makes all of its normal members satisfy the scope. The actual-extension proxy of Nickel's modal "ways" (his own simplification).

    Equations
    Instances For

      Conservativity #

      theorem Quantification.genNormalcy_conservative {α : Type u_1} [Fintype α] (normal : αProp) :

      The normalcy-restricted generic is conservative ([BC81]).

      theorem Quantification.genWays_conservative {α : Type u_1} [Fintype α] {ι : Type u_2} (normalIn : αιProp) (ways : Finset ι) :
      Conservative (genWays normalIn ways)

      The ways-of-normality generic is conservative ([BC81]).

      theorem Quantification.genWays_singleton {α : Type u_1} [Fintype α] {ι : Type u_2} (normalIn : αιProp) (w : ι) :
      genWays normalIn {w} = genNormalcy fun (x : α) => normalIn x w

      A single way of being normal reduces genWays to genNormalcy: [Nic09]'s account is the traditional one when there is only one respect of normality.

      Proportionality separates majority from normalcy #

      The majority operator is already Proportional (most_proportional, in Counting): the formal content of "generics as majority quantification" — true of this operator ([Coh99]'s absolute reading), which his homogeneity and relative reading, and the later literature ([Nic09], [Les08]), reject as a theory of generics. The normalcy schema is not proportional.

      theorem Quantification.genNormalcy_not_ratio_determined :
      (genNormalcy (fun (x : Fin 2) => x = 0) (fun (x : Fin 2) => True) fun (x : Fin 2) => x = 0) ¬genNormalcy (fun (x : Fin 2) => x = 0) (fun (x : Fin 2) => True) fun (x : Fin 2) => x = 1

      The normalcy generic is NOT ratio-determined (hence not Proportional, unlike most_sem / most_proportional): over Fin 2 with only 0 normal, {0}-in-scope is generic-true while {1}-in-scope is generic-false, yet both have |R ∩ S| : |R ∖ S| = 1 : 1.