Documentation

Studies.Magri2014

Magri (2014): An Account for the Homogeneity Effect Triggered by Plural Definites and Conjunction #

This file formalizes the double-strengthening account of homogeneity of [Mag14]. A plural definite has the plain existential meaning of the indefinite, and its universal reading is an implicature of an implicature: the indefinite triggers the only some inference, and the definite triggers the inference that this inference is false, by the iterated exhaustification (19) of [Spe07a] over the exhaustivity operator (18). The paper's abstract configuration (§5.2) is three items, the item displaying homogeneity and the weak and strong poles of the scale it patterns with (Item), with a non-transitive Horn-mateness that pairs the item with one pole only. In the primal theory (52) the item means the weak pole and is a Horn-mate of it (primal, primalMates), so the inner exhaustification excludes nothing for the item while the outer one, denying the strengthened meaning of the weak pole, yields the strong one, (53b) (strengthened_primal_mystery_eq_strong); in a downward-entailing environment the negated meanings are already strongest and nothing is strengthened, (53a) (strengthened_primal_not_mystery). The dual theory (54), (55) turns this upside down by swapping the poles (dual, dualMates), and its computations are the primal ones relabeled (strengthened_comp_equiv). In a scenario where the weak pole holds without the strong both the positive and the negated sentence are false after strengthening, the homogeneity gap (primal_gap, dual_gap).

Plural definites and plural morphology instantiate the primal theory with cardinality thresholds over the extension of the predicate, (32) (atLeast, the_eq_all), and the same computation in the non-monotonic scope of exactly one student gives universal force in its upward and existential force in its downward component, (37) (exactlyOne_the). Unfocused conjunction instantiates the dual theory (§5.3), so under negation it behaves as disjunction, (61) (not_andUnF_eq_not_or); with the appendix's enriched alternatives, the atomic conjuncts (69), the same result comes out of [Fox07]'s innocent exclusion, (71) and (72) (strengthened_not_andUnF). Questions, which license no strengthening, would tell the theories apart, (62) and (63), and the paper conjectures (§4) that a matrix definite has universal force exactly when the indefinite triggers its implicature, which yields the sloppy existential reading of the classroom example of [Gaj05]; neither is modeled.

Implementation notes #

TODO #

References #

Iterated exhaustification over Horn-mates (§3.1, §3.2) #

def Magri2014.exh {W : Type u_1} {ι : Type u_2} [Fintype W] [DecidableEq W] (mates : ι → Finset ι) (m : ι → Finset W) (i : ι) :
Finset W

(18) with each item's own Horn-mates: the meaning of the item i exhaustified against the meanings of its Horn-mates.

Equations
Instances For
    def Magri2014.strengthened {W : Type u_1} {ι : Type u_2} [Fintype W] [DecidableEq W] (mates : ι → Finset ι) (m : ι → Finset W) :
    ι → Finset W

    (19): the strengthened meaning is the iterated exhaustification of [Spe07a], the outer operator denying the strengthened meanings of the Horn-mates. Two iterations suffice for every configuration of the paper.

    Equations
    Instances For
      theorem Magri2014.exh_comp_equiv {W : Type u_1} {ι : Type u_2} [Fintype W] [DecidableEq W] [DecidableEq ι] (σ : ι ≃ ι) (mates : ι → Finset ι) (m : ι → Finset W) :
      exh (fun (i : ι) => Finset.image (⇑σ.symm) (mates (σ i))) (m ∘ ⇑σ) = exh mates m ∘ ⇑σ

      Relabeling the items by a permutation, with the Horn-mates carried along, relabels the exhaustified meanings.

      theorem Magri2014.strengthened_comp_equiv {W : Type u_1} {ι : Type u_2} [Fintype W] [DecidableEq W] [DecidableEq ι] (σ : ι ≃ ι) (mates : ι → Finset ι) (m : ι → Finset W) :
      strengthened (fun (i : ι) => Finset.image (⇑σ.symm) (mates (σ i))) (m ∘ ⇑σ) = strengthened mates m ∘ ⇑σ

      Relabeling commutes with strengthening.

      The primal and the dual theory (§5.2) #

      inductive Magri2014.Item :

      The three items of a homogeneity configuration: the item displaying homogeneity and the weak and strong poles of the scale it patterns with.

      Instances For
        @[instance_reducible]
        instance Magri2014.instDecidableEqItem :
        DecidableEq Item
        Equations

        (52b): in the primal theory the item is a Horn-mate of the weak pole only, while the two poles are Horn-mates of each other.

        Equations
        Instances For
          def Magri2014.primal {W : Type u_1} (wk st : Finset W) :
          Item → Finset W

          (52a): in the primal theory the item means the weak pole.

          Equations
          Instances For
            @[reducible, inline]
            abbrev Magri2014.swap :
            Equiv.Perm Item

            The dual theory turns the primal upside down by exchanging the poles.

            Equations
            Instances For
              def Magri2014.dualMates (i : Item) :
              Finset Item

              (54b): in the dual theory the item is a Horn-mate of the strong pole only.

              Equations
              Instances For
                def Magri2014.dual {W : Type u_1} (wk st : Finset W) :
                Item → Finset W

                (54a): in the dual theory the item means the strong pole.

                Equations
                Instances For
                  theorem Magri2014.compl_comp_primal {W : Type u_1} [Fintype W] [DecidableEq W] {wk st : Finset W} :
                  compl ∘ primal wk st = primal wkᶜ stᶜ

                  Negating each meaning of the primal theory negates its poles.

                  theorem Magri2014.compl_comp_dual {W : Type u_1} [Fintype W] [DecidableEq W] {wk st : Finset W} :
                  compl ∘ dual wk st = dual wkᶜ stᶜ

                  Negating each meaning of the dual theory negates its poles.

                  theorem Magri2014.strengthened_dual {W : Type u_1} [Fintype W] [DecidableEq W] {wk st : Finset W} :

                  The dual computations are the primal ones with the poles exchanged.

                  theorem Magri2014.exh_primal_mystery {W : Type u_1} [Fintype W] [DecidableEq W] {wk st : Finset W} :

                  The item has nothing to exclude at the inner level: its only Horn-mate means the same.

                  theorem Magri2014.exh_primal_weak {W : Type u_1} [Fintype W] [DecidableEq W] {wk st : Finset W} (h : (wk \ st).Nonempty) :
                  exh primalMates (primal wk st) Item.weak = wk \ st

                  The weak pole denies the strong one when it can.

                  theorem Magri2014.exh_primal_weak_of_subset {W : Type u_1} [Fintype W] [DecidableEq W] {wk st : Finset W} (h : wk ⊆ st) :

                  The weak pole excludes nothing when the strong pole is not stronger.

                  theorem Magri2014.strengthened_primal_mystery {W : Type u_1} [Fintype W] [DecidableEq W] {wk st : Finset W} (h₁ : (wk \ st).Nonempty) (h₂ : (wk ∩ st).Nonempty) :

                  The core of (53b) and (37): double strengthening conjoins the item with the strong pole.

                  theorem Magri2014.strengthened_primal_mystery_of_subset {W : Type u_1} [Fintype W] [DecidableEq W] {wk st : Finset W} (h : wk ⊆ st) :

                  With nothing to exclude at either level the item keeps its plain meaning.

                  theorem Magri2014.strengthened_primal_mystery_eq_strong {W : Type u_1} [Fintype W] [DecidableEq W] {wk st : Finset W} (h : st ⊆ wk) (hne : st.Nonempty) :

                  (53b): in an upward-entailing environment the primal item strengthens to the strong pole.

                  theorem Magri2014.strengthened_primal_not_mystery {W : Type u_1} [Fintype W] [DecidableEq W] {wk st : Finset W} (h : st ⊆ wk) :

                  (53a): under negation the primal item is not strengthened and shows its weak meaning.

                  theorem Magri2014.strengthened_dual_mystery {W : Type u_1} [Fintype W] [DecidableEq W] {wk st : Finset W} (h : st ⊆ wk) :

                  (55b): in an upward-entailing environment the dual item shows its strong meaning.

                  theorem Magri2014.strengthened_dual_not_mystery {W : Type u_1} [Fintype W] [DecidableEq W] {wk st : Finset W} (h : st ⊆ wk) (h₁ : (wk \ st).Nonempty) (h₂ : wkᶜ.Nonempty) :

                  (55a): under negation the dual item strengthens to the negation of the weak pole.

                  theorem Magri2014.primal_gap {W : Type u_1} [Fintype W] [DecidableEq W] {wk st : Finset W} (h : st ⊆ wk) (hne : st.Nonempty) :

                  The homogeneity gap of the primal theory: the worlds where neither the item nor its negation is true after strengthening are those where the weak pole holds without the strong.

                  theorem Magri2014.dual_gap {W : Type u_1} [Fintype W] [DecidableEq W] {wk st : Finset W} (h : st ⊆ wk) (h₁ : (wk \ st).Nonempty) (h₂ : wkᶜ.Nonempty) :

                  The homogeneity gap of the dual theory is the same.

                  Plural definites and plural morphology (§3.3, §3.4) #

                  def Magri2014.atLeast (D : Type u_3) [Fintype D] (n : ℕ) :
                  Finset (Finset D)

                  The worlds, extensions of the predicate over the domain D, where at least n members satisfy it.

                  Equations
                  Instances For
                    @[reducible, inline]
                    abbrev Magri2014.some (D : Type u_3) [Fintype D] :
                    Finset (Finset D)

                    (31c), (24c): SOME and SING, at least one.

                    Equations
                    Instances For
                      @[reducible, inline]
                      abbrev Magri2014.two (D : Type u_3) [Fintype D] :
                      Finset (Finset D)

                      (24b): TWO, at least two.

                      Equations
                      Instances For
                        @[reducible, inline]
                        abbrev Magri2014.all (D : Type u_3) [Fintype D] :
                        Finset (Finset D)

                        (31b): ALL, the whole domain.

                        Equations
                        Instances For
                          theorem Magri2014.mem_atLeast {D : Type u_3} [Fintype D] {n : ℕ} {s : Finset D} :
                          s ∈ atLeast D n ↔ n ≤ s.card
                          theorem Magri2014.mem_all {D : Type u_3} [Fintype D] {s : Finset D} :
                          s ∈ all D ↔ s = Finset.univ
                          theorem Magri2014.atLeast_subset_atLeast {D : Type u_3} [Fintype D] {m n : ℕ} (h : m ≤ n) :
                          atLeast D n ⊆ atLeast D m

                          A higher threshold is stronger.

                          theorem Magri2014.atLeast_nonempty {D : Type u_3} [Fintype D] {n : ℕ} (h : n ≤ Fintype.card D) :
                          (atLeast D n).Nonempty

                          A threshold within the domain is satisfiable.

                          theorem Magri2014.strengthened_atLeast {D : Type u_3} [Fintype D] [DecidableEq D] {m n : ℕ} (hmn : m ≤ n) (hn : n ≤ Fintype.card D) :

                          (27), (34): an item that means a lower threshold and is a Horn-mate of it strengthens to the higher threshold, the plurality inference of PL and the universal reading of THE.

                          theorem Magri2014.the_eq_all {D : Type u_3} [Fintype D] [DecidableEq D] [Nonempty D] :

                          (34): Mary saw the boys is universal.

                          theorem Magri2014.not_the_eq_not_some {D : Type u_3} [Fintype D] [DecidableEq D] [Nonempty D] :

                          (35): Mary didn't see the boys is Mary saw none of the boys.

                          theorem Magri2014.the_gap {D : Type u_3} [Fintype D] [DecidableEq D] [Nonempty D] :

                          The definite's homogeneity gap: the worlds where some but not all boys were seen.

                          Non-monotonic environments (§3.4) #

                          def Magri2014.solvedBy (S : Type u_3) (P : Type u_4) [Fintype S] [Fintype P] [DecidableEq S] (q : Finset P → Prop) [DecidablePred q] (n : ℕ) :
                          Finset (S → Finset P)

                          The worlds, assignments of solved problems to students, where the number of students whose solved problems satisfy q is exactly n.

                          Equations
                          Instances For
                            def Magri2014.exactlyOneSome (S : Type u_3) (P : Type u_4) [Fintype S] [Fintype P] [DecidableEq S] :
                            Finset (S → Finset P)

                            (36c): ∃!SOME, exactly one student solved some of the problems.

                            Equations
                            Instances For
                              def Magri2014.exactlyOneAll (S : Type u_3) (P : Type u_4) [Fintype S] [Fintype P] [DecidableEq S] [DecidableEq P] :
                              Finset (S → Finset P)

                              (36b): ∃!ALL, exactly one student solved all the problems.

                              Equations
                              Instances For
                                def Magri2014.uniqueSolverAll (S : Type u_3) (P : Type u_4) [Fintype S] [Fintype P] [DecidableEq S] [DecidableEq P] :
                                Finset (S → Finset P)

                                ¬∃₂SOME ∧ ∃₁ALL: at most one student solved some of the problems, and one solved them all.

                                Equations
                                • Magri2014.uniqueSolverAll S P = {w : S → Finset P | {s : S | 1 ≤ (w s).card}.card ≤ 1 ∧ ∃ (s : S), w s = Finset.univ}
                                Instances For
                                  theorem Magri2014.exactlyOneSome_inter_exactlyOneAll {S : Type u_3} {P : Type u_4} [Fintype S] [Fintype P] [DecidableEq S] [DecidableEq P] [Nonempty P] :

                                  The last step of (37): exactly one solved some and exactly one solved all iff at most one solved some and one solved all.

                                  theorem Magri2014.exactlyOne_the {S : Type u_3} {P : Type u_4} [Fintype S] [Fintype P] [DecidableEq S] [DecidableEq P] [Nonempty P] (h₁ : (exactlyOneSome S P \ exactlyOneAll S P).Nonempty) (h₂ : (exactlyOneSome S P ∩ exactlyOneAll S P).Nonempty) :

                                  (37): in the scope of exactly one student the definite strengthens to ∃!THE ∧ ∃!ALL, that is, exactly one student solved some of the problems and that student solved them all: universal force in the upward-entailing component and existential force in the downward-entailing one. The hypotheses are the consistency conditions of the two exclusions.

                                  Unfocused conjunction (§5.3, Appendix) #

                                  inductive Magri2014.Boy :

                                  The two boys of (47).

                                  Instances For
                                    @[instance_reducible]
                                    instance Magri2014.instDecidableEqBoy :
                                    DecidableEq Boy
                                    Equations
                                    @[instance_reducible]
                                    instance Magri2014.instFintypeBoy :
                                    Fintype Boy
                                    Equations

                                    (56): unfocused conjunction instantiates the dual theory with disjunction as the weak and focused conjunction as the strong pole, over the worlds that record which boys Mary saw.

                                    The five sentences of the appendix's enriched configuration (69): focused and unfocused conjunction, the two atomic conjuncts, and disjunction.

                                    Instances For
                                      @[instance_reducible]
                                      Equations

                                      (71): one exhaustification of the negated sentences; unfocused conjunction excludes nothing, since denying either negated conjunct forces the other.

                                      (72): with the enriched alternatives, negated unfocused conjunction still strengthens to negated disjunction, as in (61).

                                      The enriched computation and the abstract dual one agree.