Documentation

Linglib.Theories.Semantics.Degree.Intervals

Schwarzschild's Interval Semantics #

@cite{schwarzschild-2005} @cite{schwarzschild-2008} @cite{schwarzschild-wilkinson-2002}

@cite{schwarzschild-2008} "The Semantics of Comparatives and Other Degree Constructions": degrees are reified as intervals on a scale, and degree morphology manipulates these intervals.

Key Ideas #

  1. Degrees as intervals: Rather than points on a scale, degrees are intervals [0, d] (for "tall") or [d, max] (for "short"). The measure function maps entities to intervals.

  2. Than-clause: Denotes the interval associated with the standard entity. The comparative asserts that the matrix interval properly contains the standard interval.

  3. Subcomparatives: The interval approach naturally handles subcomparatives ("longer than the desk is wide") because intervals from different scales can be compared when they share a common unit of measurement.

  4. Differential comparatives: "3 inches taller" specifies the difference between intervals, natural in the interval framework.

An interval on a linearly ordered scale. Schwarzschild treats degrees as intervals rather than points. For a positive adjective like "tall", the interval is [0, μ(x)].

Instances For
    def Semantics.Degree.Intervals.positiveInterval {Entity : Type u_1} {D : Type u_2} [LinearOrder D] [BoundedOrder D] (μ : EntityD) (x : Entity) :

    The positive interval for entity x: [⊥, μ(x)]. This is the "extent to which x is tall" — the interval from the bottom of the scale to x's degree.

    Equations
    Instances For
      def Semantics.Degree.Intervals.intervalComparative {Entity : Type u_1} {D : Type u_2} [LinearOrder D] [BoundedOrder D] (μ : EntityD) (a b : Entity) :

      Schwarzschild's comparative: the matrix interval properly extends beyond the standard interval. For positive adjectives, this means [0, μ(a)] properly contains [0, μ(b)], i.e., μ(a) > μ(b).

      Equations
      Instances For
        theorem Semantics.Degree.Intervals.interval_eq_point {Entity : Type u_1} {D : Type u_2} [LinearOrder D] [BoundedOrder D] (μ : EntityD) (a b : Entity) :
        intervalComparative μ a b μ b < μ a

        Interval comparative reduces to Kennedy/Heim point comparison. This is expected: for positive intervals [0, μ(x)], comparing upper bounds IS comparing degrees.

        def Semantics.Degree.Intervals.differentialInterval {Entity : Type u_1} {D : Type u_2} [LinearOrder D] [BoundedOrder D] (μ : EntityD) (a b : Entity) (h : μ b μ a) :

        Differential comparative: "A is d-much taller than B" asserts that the gap between intervals has extent d.

        In Schwarzschild's framework, the differential is the interval [μ(b), μ(a)] — the gap between the standard and matrix intervals.

        Equations
        Instances For
          def Semantics.Degree.Intervals.subcomparative {Entity : Type u_1} {D : Type u_2} [LinearOrder D] (μ₁ μ₂ : EntityD) (a b : Entity) :

          Subcomparative: "The table is longer than it is wide."

          Both matrix and standard provide intervals on DIFFERENT scales, but the intervals are compared via a shared unit of measurement (inches, centimeters, etc.).

          Schwarzschild: subcomparatives require that the two scales be commensurable — measurable in the same units.

          Equations
          Instances For
            theorem Semantics.Degree.Intervals.positiveInterval_iff_posExt {Entity : Type u_1} {D : Type u_2} [LinearOrder D] [BoundedOrder D] (μ : EntityD) (x : Entity) (d : D) :

            The positive interval's membership predicate is exactly posExt: d is in the interval [⊥, μ(x)] iff d ∈ posExt(μ, x). This connects Schwarzschild's interval semantics to the algebraic extent functions in Core.Scale.