Documentation

Studies.Haslinger2025

Haslinger (2025): Pragmatic constraints on imprecision and homogeneity #

Haslinger argues that the availability of imprecise construals is regulated not in the lexicon but by alternatives, through two constraints. No Needless Manner Violations combines two Manner preferences, for lower structural complexity and for less potential for imprecision, as Pareto dominance, and blocks a sentence that a potentially p-equivalent alternative dominates. Inference Preservation blocks an imprecise construal of a subexpression that loses an inference, entailment or incompatibility, that its precise construal licenses about an alternative.

Main results #

Implementation notes #

The Manner orderings are read off two natural-number measures on an abstract sentence type, with potential p-equivalence a relation parameter, since the dissertation's (68) quantifies over contexts that differ only in the issue parameter. Degree expressions are construals over ℚ, the precise interpretation the exact value and the imprecise one the halo of a contextual deviation m, (69)–(70). The conventionalized scales of §6.2.1 are sets of expressions; here a scale is the multiples of its width over the numerals' values, given by the widths salient in a context, so roundness, (22), is Numerals.Roundness.AtLeastAsRound over Numerals.Roundness.OnScale. The dissertation's examples are the rows of Data/Examples/Haslinger2025.json; its Ch. 5 extensions to presupposition and redundancy and the collective exceptions of Ch. 7 are not modelled.

References #

No Needless Manner Violations #

def Haslinger2025.manner {S : Type u_1} (complexity potential : S → ℕ) (φ : S) :
ℕ × ℕ

The Manner profile of a sentence pairs its structural complexity with its potential for imprecision, the two orderings of (58), combined by the product order as in (57).

Equations
Instances For
    @[reducible, inline]
    abbrev Haslinger2025.Blocked {S : Type u_1} (complexity potential : S → ℕ) (PotEquiv : S → S → Prop) (ψ : S) :

    A cooperative speaker will not use ψ when a potentially p-equivalent φ is at least as good on both orderings and better on one, (59): competition among the potentially p-equivalent sentences along the Manner profile.

    Equations
    Instances For
      theorem Haslinger2025.lt_complexity_of_lt_potential {S : Type u_1} (complexity potential : S → ℕ) (PotEquiv : S → S → Prop) {φ ψ : S} (h : PotEquiv φ ψ) (hp : potential φ < potential ψ) (hb : ¬Blocked complexity potential PotEquiv ψ) :
      complexity ψ < complexity φ

      By the form–meaning correlation, an unblocked sentence with more potential for imprecision than a potentially p-equivalent competitor is strictly simpler than it.

      The sentences of (6) and (8) are the definite plural, the universal quantifier that contains it, and the hypothetical definite that would contain the quantifier.

      Instances For
        @[instance_reducible]
        Equations
        def Haslinger2025.instReprPlural.repr :
        Plural → ℕ → Std.Format
        Equations
        Instances For

          In structural complexity all the doors contains the doors, and the hypothetical (8a) contains all doors.

          Equations
          Instances For

            The definites have potential for imprecision and the universal quantifier does not.

            Equations
            Instances For

              A definite built on the quantifier is dominated by the quantifier, so it is blocked wherever the two are potentially p-equivalent, (8).

              Inference Preservation #

              structure Haslinger2025.Construal (D : Type u_1) :
              Type u_1

              A subexpression's precise and imprecise interpretations in a context, as predicates over a domain of degrees or worlds.

              • precise : D → Prop
              • imprecise : D → Prop
              Instances For
                def Haslinger2025.valued {D : Type u_1} (P : D → Prop) :
                Bool → D → Prop

                [X]^p is the truth set of a predicate for p = true and its falsity set for p = false.

                Equations
                Instances For
                  @[instance_reducible]
                  instance Haslinger2025.instDecidableValuedOfDecidablePred {D : Type u_1} (P : D → Prop) [DecidablePred P] (p : Bool) (d : D) :
                  Decidable (valued P p d)
                  Equations
                  • One or more equations did not get rendered due to their size.
                  def Haslinger2025.Violates {D : Type u_1} (φ ψ : Construal D) :

                  Inference Preservation (18), for one alternative ψ of the subexpression φ, blocks the use when, for some truth value, the precise truth of φ entails that status of ψ, the precise falsity of φ does not, but the imprecise truth of φ fails to entail the imprecise status of ψ.

                  Equations
                  • One or more equations did not get rendered due to their size.
                  Instances For

                    Degree expressions (Ch. 6) #

                    def Haslinger2025.numeral (n : ℤ) (m : ℚ) :

                    A bare numeral is read with deviation at most m, (69a) and (70a).

                    Equations
                    • Haslinger2025.numeral n m = { precise := fun (d : ℚ) => d = ↑n, imprecise := fun (d : ℚ) => |d - ↑n| ≤ m }
                    Instances For
                      def Haslinger2025.moreThan (n : ℤ) (m : ℚ) :

                      More than n is read with deviation at most m, (69b) and (70b).

                      Equations
                      Instances For
                        theorem Haslinger2025.numeral_violates_of_le {n n' : ℤ} (h : n ≠ n') {m : ℚ} (hd : |↑n - ↑n'| ≤ 2 * m) :
                        Violates (numeral n m) (numeral n' m)

                        Two distinct bare numerals whose halos meet violate Inference Preservation, being incompatible precisely and compatible imprecisely.

                        theorem Haslinger2025.not_numeral_violates_of_lt {n n' : ℤ} (h : n ≠ n') {m : ℚ} (hd : 2 * m < |↑n - ↑n'|) :
                        ¬Violates (numeral n m) (numeral n' m)

                        Distinct bare numerals whose halos are apart preserve every inference.

                        Roundness and alternatives (§6.2) #

                        def Haslinger2025.decimal :
                        Finset ℤ

                        The cardinal scales of (15) have widths fifty, twenty-five, ten, five and one.

                        Equations
                        Instances For
                          def Haslinger2025.clock :
                          Finset ℤ

                          The clock-time scales of (16), over minutes after midnight, count quarter hours, five minutes and minutes.

                          Equations
                          Instances For
                            def Haslinger2025.angle :
                            Finset ℤ

                            The angle scales of (17) have widths ninety, ten, five and one degrees.

                            Equations
                            Instances For
                              theorem Haslinger2025.forall_not_violates_iff {W : Finset ℤ} {n : ℤ} (hW : 0 ∉ W) {m : ℚ} :
                              (∀ (n' : ℤ), n' ≠ n → Numerals.Roundness.AtLeastAsRound (Numerals.Roundness.OnScale W) n n' → ¬Violates (numeral n m) (numeral n' m)) ↔ 2 * m < ↑(Numerals.Roundness.scaleLcm W n)

                              A bare numeral read with deviation m survives Inference Preservation against every alternative at least as round, (79a), exactly when m is under half the lcm of the widths of its scales.

                              theorem Haslinger2025.ninetyNine_hundred {m : ℚ} :
                              ((∀ (n' : ℤ), n' ≠ 99 → Numerals.Roundness.AtLeastAsRound (Numerals.Roundness.OnScale decimal) 99 n' → ¬Violates (numeral 99 m) (numeral n' m)) ↔ m < 1 / 2) ∧ ((∀ (n' : ℤ), n' ≠ 100 → Numerals.Roundness.AtLeastAsRound (Numerals.Roundness.OnScale decimal) 100 n' → ¬Violates (numeral 100 m) (numeral n' m)) ↔ m < 25)

                              99 lies only on the scale of units, so its imprecise reading is blocked from half a unit of deviation; 100 lies on every cardinal scale, so its alternatives are the multiples of fifty and it survives deviations under twenty-five.

                              theorem Haslinger2025.tolerated_deviation_is_inferred_cell {W : Finset ℤ} {n : ℤ} {μs : MeasureTheory.Measure ↥W} {ν : MeasureTheory.Measure ℝ} [MeasureTheory.SFinite ν] {r : ENNReal} {I : Set ℝ} {m : ℚ} (hν : ∀ ⦃s : Set ℝ⦄, MeasurableSet s → s ⊆ I → ν s = r * MeasureTheory.volume s) (hr : r ≠ 0) (hr' : r ≠ ⊤) (hpos : ∀ w ∈ W, 0 < w) (hWd : ∀ a ∈ W, ∀ b ∈ W, a ∣ b ∨ b ∣ a) (hs : ∀ (v w : ↥W), μs {v} = μs {w}) (hs0 : ∀ (w : ↥W), μs {w} ≠ 0) (hs' : ∀ (w : ↥W), μs {w} ≠ ⊤) (hI : ∀ (w : ↥W), Set.Ico (↑n - ↑↑w / 2) (↑n + ↑↑w / 2) ⊆ I) (hne : {x ∈ W | x ∣ n}.Nonempty) {w : ↥W} (hw : ∀ (v : ↥W), (μs.prod ν) (Krifka2007.reportedOn v n) ≤ (μs.prod ν) (Krifka2007.reportedOn w n)) :
                              (∀ (n' : ℤ), n' ≠ n → Numerals.Roundness.AtLeastAsRound (Numerals.Roundness.OnScale W) n n' → ¬Violates (numeral n m) (numeral n' m)) ↔ 2 * m < ↑↑w

                              Under Krifka's hearer model on aligned salient scales, the deviation a bare numeral tolerates under Inference Preservation is half the width of the most probable scale for its report: the dissertation's alternative-based bound is the cell of the scale the hearer infers.

                              theorem Haslinger2025.moreThan_blocked (n : ℤ) {m : ℚ} (hm : 0 < m) :

                              more than n is blocked by its alternative bare n at any positive deviation, (69)–(70), since the imprecise comparative overlaps the exact value it is precisely incompatible with.

                              Conjunctions (Ch. 7) #

                              def Haslinger2025.conjunction :
                              Construal (Fin 3 → Bool)

                              Bert, Claire and Dora were there, (19)–(20), is precisely maximal and imprecisely non-maximal over the worlds recording who was there.

                              Equations
                              • Haslinger2025.conjunction = { precise := fun (w : Fin 3 → Bool) => ∀ (i : Fin 3), w i = true, imprecise := fun (w : Fin 3 → Bool) => ∃ (i : Fin 3), w i = true }
                              Instances For
                                def Haslinger2025.conjunct (i : Fin 3) :
                                Construal (Fin 3 → Bool)

                                A conjunct alternative, Bert was there, with no potential for imprecision.

                                Equations
                                • Haslinger2025.conjunct i = { precise := fun (w : Fin 3 → Bool) => w i = true, imprecise := fun (w : Fin 3 → Bool) => w i = true }
                                Instances For

                                  The non-maximal construal of the conjunction loses the entailment of each conjunct that the precise construal licenses, so only the maximal construal survives Inference Preservation.