Documentation

Studies.BarLev2025

Bar-Lev (2025): Homogeneity, underspecification, and ambiguity in plural predication #

Plural predication is homogeneous: if only half of the four kids laughed, neither the four kids laughed nor its negation can be truthfully uttered. Bar-Lev traces homogeneity to pluralization by a trivalent version of Link's star operator, which makes a plural predicate true of a sum of pluralities that satisfy it and false of a plurality no part of which does. Relativized to a cover of the parts that matter in the context, the operator yields three meaning types, his Table 1. A cover by all the parts gives an underspecified reading with total homogeneity, as with lift the table. A cover by the atoms gives a distributive reading with homogeneity over the atoms, and a cover by the plurality itself a collective reading with no homogeneity, as with weigh exactly 250 lbs.

The truth and falsity conditions of the trivalent star are the two ends of the readings of the plural predication (sUnion_readings_coverStar), which is how the paper's appendix places the account in Križ and Spector's framework. The models check the paper's contrasts. When half of the kids lift the table together, the four kids (didn't) lift the table has no truth value (lift_half_gap), where homogeneity over the atoms would make the negation true (distributive_half_false). Lifting individually, together, or in two halves makes the sentence true (lift_true), so that the four kids didn't lift the table but they did together is contradictory. These two people don't weigh 250 lbs is true both when they weigh 125 lbs each and when they weigh 250 lbs each, which needs the two minimal covers (weigh_ambiguous), since under a cover by all the parts the positive sentence is true in both situations (weigh_true_of_power_cover).

Implementation notes #

Pluralities are nonempty finite sets of individuals, sum is union, and the atoms are the singletons. A cover is a set of pluralities with no empty one; the minimal covers of (24b) are the atoms of x and {x} itself (eq_atoms_of_minimal, eq_singleton_of_minimal). A sentence is true where all of its readings are and false where none is; Bar-Lev states this trivalence as a presupposition, which the readings leave open.

TODO #

References #

Covers and the trivalent star (§2, §4, §5) #

def BarLev2025.coverStar {α : Type u_1} {W : Type u_2} [DecidableEq α] (C : Set (Finset α)) (P : Finset α → W → Prop) (z : Finset α) :
Set W

Plural predication relative to a cover C, (25) and (30), holds of a plurality that is a sum of pluralities in C that satisfy P.

Equations
Instances For
    theorem BarLev2025.sUnion_readings_coverStar {α : Type u_1} {W : Type u_2} [DecidableEq α] {C : Set (Finset α)} {P : Finset α → W → Prop} {x : Finset α} (hC : ∀ z ∈ C, z.Nonempty) :
    ⋃₀ Homogeneity.readings (coverStar C P) x = {w : W | ∃ z ∈ C, z ⊆ x ∧ P z w}

    By the trivalent star, (12) and (31b), the plural predication is false exactly where no part of x in the cover satisfies P.

    theorem BarLev2025.eq_atoms_of_minimal {α : Type u_1} [DecidableEq α] {C : Set (Finset α)} {x : Finset α} (hx : x.Nonempty) (hmin : Minimal (fun (C : Set (Finset α)) => Mereology.AlgClosure (fun (x : Finset α) => x ∈ C) x) C) (hat : ∀ a ∈ x, {a} ∈ C) :
    C = (fun (a : α) => {a}) '' ↑x

    A minimal cover containing the atoms of x, (24b-i), consists of the atoms of x.

    theorem BarLev2025.eq_singleton_of_minimal {α : Type u_1} [DecidableEq α] {C : Set (Finset α)} {x : Finset α} (hmin : Minimal (fun (C : Set (Finset α)) => Mereology.AlgClosure (fun (x : Finset α) => x ∈ C) x) C) (hxC : x ∈ C) :
    C = {x}

    A minimal cover containing x, (24b-ii), is {x}.

    theorem BarLev2025.power_cover {α : Type u_1} {W : Type u_2} [DecidableEq α] {C : Set (Finset α)} {P : Finset α → W → Prop} {x : Finset α} (hx : x.Nonempty) (hC : ∀ z ∈ C, z.Nonempty) (hpow : ∀ y ⊆ x, y.Nonempty → y ∈ C) (hP : ∀ (w : W), ¬P ∅ w) :
    ⋂₀ Homogeneity.readings (coverStar C P) x = {w : W | Mereology.AlgClosure (fun (x : Finset α) => P x w) x} ∧ ⋃₀ Homogeneity.readings (coverStar C P) x = {w : W | ∃ z ⊆ x, z.Nonempty ∧ P z w}

    Under a cover by all the parts of x, (32), the reading is underspecified, ⋆P itself, and homogeneity is total: the sentence is false only where no part of x satisfies P.

    theorem BarLev2025.atomic_cover {α : Type u_1} {W : Type u_2} [DecidableEq α] {P : Finset α → W → Prop} {x : Finset α} (hx : x.Nonempty) :
    ⋂₀ Homogeneity.readings (coverStar ((fun (a : α) => {a}) '' ↑x) P) x = {w : W | ∀ a ∈ x, P {a} w} ∧ ⋃₀ Homogeneity.readings (coverStar ((fun (a : α) => {a}) '' ↑x) P) x = {w : W | ∃ a ∈ x, P {a} w}

    Under the cover by the atoms of x, (33), the reading is distributive and homogeneity concerns the atoms: the sentence is false only where no atom of x satisfies P.

    theorem BarLev2025.singleton_cover {α : Type u_1} {W : Type u_2} [DecidableEq α] {P : Finset α → W → Prop} {x : Finset α} (hx : x.Nonempty) :
    ⋂₀ Homogeneity.readings (coverStar {x} P) x = {w : W | P x w} ∧ ⋃₀ Homogeneity.readings (coverStar {x} P) x = {w : W | P x w}

    Under the cover by x itself, (34), the reading is collective and there is no homogeneity: the sentence is true where x satisfies P and false elsewhere.

    lift the table: underspecification and total homogeneity (§2, §3) #

    @[reducible, inline]

    Four kids.

    Equations
    Instances For

      In the situations of (3), (13) and §3, the kids lift the table individually, all together, in two halves, or half of them together while the other half does nothing.

      Instances For
        @[instance_reducible]
        Equations
        def BarLev2025.lifted :
        Finset Kid → Lifting → Prop

        Which pluralities of kids lifted the table in each situation.

        Equations
        Instances For
          @[instance_reducible]
          instance BarLev2025.instDecidableLifted (z : Finset Kid) (w : Lifting) :
          Decidable (lifted z w)
          Equations
          • One or more equations did not get rendered due to their size.
          theorem BarLev2025.distributive_half_false :
          Lifting.half ∉ ⋃₀ Homogeneity.readings (fun (z : Finset Kid) => {w : Lifting | ∀ a ∈ z, lifted {a} w}) Finset.univ

          A homogeneity presupposition on the atoms, Gajewski's distributivity operator (7), makes the sentence false in the same situation, so that its negation would be true.

          theorem BarLev2025.lift_true {C : Set (Finset Kid)} (hC : ∀ z ∈ C, z.Nonempty) (hpow : ∀ (y : Finset Kid), y.Nonempty → y ∈ C) (w : Lifting) :

          Under a cover by all the parts, the four kids lifted the table is true whether they lifted it individually, together, or in two halves, (13) and the intermediate situation of §3.

          theorem BarLev2025.lift_half_gap {C : Set (Finset Kid)} (hC : ∀ z ∈ C, z.Nonempty) (hpow : ∀ (y : Finset Kid), y.Nonempty → y ∈ C) :
          Lifting.half ∉ ⋂₀ Homogeneity.readings (coverStar C lifted) Finset.univ ∧ Lifting.half ∈ ⋃₀ Homogeneity.readings (coverStar C lifted) Finset.univ

          When half of the kids lift the table together and the other half does nothing, (3), the sentence is neither true nor false, so neither it nor its negation can be truthfully uttered.

          weigh exactly 250 lbs: ambiguity (§3) #

          The two people of (17) weigh 125 lbs each or 250 lbs each.

          Instances For
            @[instance_reducible]
            Equations
            def BarLev2025.weighs250 :
            Finset (Fin 2) → Weighing → Prop

            Which pluralities of the two people weigh exactly 250 lbs.

            Equations
            Instances For
              @[instance_reducible]
              instance BarLev2025.instDecidableWeighs250 (z : Finset (Fin 2)) (w : Weighing) :
              Decidable (weighs250 z w)
              Equations
              • One or more equations did not get rendered due to their size.
              theorem BarLev2025.weigh_true_of_power_cover {C : Set (Finset (Fin 2))} (hC : ∀ z ∈ C, z.Nonempty) (hpow : ∀ (y : Finset (Fin 2)), y.Nonempty → y ∈ C) (w : Weighing) :
              w ∈ ⋂₀ Homogeneity.readings (coverStar C weighs250) Finset.univ

              Under a cover by all the parts, these two people weigh 250 lbs would be true in both situations, so its negation (17) could be true in neither.

              theorem BarLev2025.weigh_ambiguous :
              Weighing.each125 ∉ ⋃₀ Homogeneity.readings (coverStar ((fun (a : Fin 2) => {a}) '' ↑Finset.univ) weighs250) Finset.univ ∧ Weighing.each250 ∉ ⋃₀ Homogeneity.readings (coverStar {Finset.univ} weighs250) Finset.univ

              With the minimal covers, (17) is true in both situations: the cover by the atoms makes the positive sentence false when each weighs 125 lbs, and the cover by the pair makes it false when each weighs 250 lbs.

              The paper's judgments #

              theorem BarLev2025.judgments_lift_the_table {C : Set (Finset Kid)} (hC : ∀ z ∈ C, z.Nonempty) (hpow : ∀ (y : Finset Kid), y.Nonempty → y ∈ C) :
              (List.lookup "true if half of the kids lifted the table together and the other half did nothing" Examples.ex_3a.readings = some Judgment.acceptable ↔ Lifting.half ∈ ⋂₀ Homogeneity.readings (coverStar C lifted) Finset.univ) ∧ (List.lookup "true if half of the kids lifted the table together and the other half did nothing" Examples.ex_3b.readings = some Judgment.acceptable ↔ Lifting.half ∉ ⋃₀ Homogeneity.readings (coverStar C lifted) Finset.univ) ∧ (List.lookup "true if half of the kids lifted the table together and the other half did too" Examples.ex_3a.readings = some Judgment.acceptable ↔ Lifting.halves ∈ ⋂₀ Homogeneity.readings (coverStar C lifted) Finset.univ)

              The judgments of (3) are the model's: neither (3a) nor its negation (3b) is true when half of the kids lift the table and the other half does nothing, and (3a) is true when each half lifts it.

              theorem BarLev2025.judgments_13 {C : Set (Finset Kid)} (hC : ∀ z ∈ C, z.Nonempty) (hpow : ∀ (y : Finset Kid), y.Nonempty → y ∈ C) :

              The four kids didn't lift the table but they did together, (13), is contradictory: lifting the table together makes the negated sentence false.

              theorem BarLev2025.judgments_17 :
              (Examples.ex_17_together.judgment = Judgment.acceptable ↔ Weighing.each125 ∉ ⋃₀ Homogeneity.readings (coverStar ((fun (a : Fin 2) => {a}) '' ↑Finset.univ) weighs250) Finset.univ ∧ weighs250 Finset.univ Weighing.each125) ∧ (Examples.ex_17_individually.judgment = Judgment.acceptable ↔ Weighing.each250 ∉ ⋃₀ Homogeneity.readings (coverStar {Finset.univ} weighs250) Finset.univ ∧ ∀ (a : Fin 2), weighs250 {a} Weighing.each250)

              These two people don't weigh 250 lbs but they do together (individually), (17), is consistent: the negated sentence is true when together they weigh 250 lbs, by the cover by the atoms, and when each weighs 250 lbs, by the cover by the pair.