Documentation

Linglib.Theories.Semantics.Degree.Little

LITTLE: Degree Negation #

The LITTLE operator @cite{heim-2006} @cite{buring-2007} as degree-predicate complementation: short = LITTLE tall, less = LITTLE -er, fewer = LITTLE many. Semantically, ⟦LITTLE⟧(P)(d) = ¬P(d). On extents, LITTLE maps posExt to negExt; on intervals (see Intervals.lean §6), it inverts the measured region.

@cite{buring-2007} uses LITTLE to analyse cross-polar nomalies: "the ladder was shorter than the house was high" works because MORE [LITTLE long] -er can be reinterpreted as LITTLE-er long (the "more-to-less metamorphosis").

Main definitions #

Main theorems #

def Semantics.Degree.Little.littlePred {D : Type u_1} (P : DProp) :
DProp

LITTLE on degree predicates: complementation.

Equations
Instances For
    theorem Semantics.Degree.Little.little_posExt_eq_negExt {Entity : Type u_1} {D : Type u_2} [LinearOrder D] (μ : EntityD) (x : Entity) (d : D) :
    littlePred (fun (x_1 : D) => x_1 Core.Scale.posExt μ x) d d Core.Scale.negExt μ x

    LITTLE maps the positive extent to the negative extent: LITTLE({d | d ≤ μ(x)}) = {d | μ(x) < d}. The formal content of "short = LITTLE tall" — the degree predicate for 'short' is the complement of the degree predicate for 'tall', exactly the relation between posExt and negExt from @cite{kennedy-1999}.

    theorem Semantics.Degree.Little.little_involution {D : Type u_1} (P : DProp) (d : D) :
    littlePred (littlePred P) d P d

    LITTLE is an involution: double degree negation cancels.

    LITTLE reverses the comparison direction: "A is LITTLE-er Adj than B" ↔ "B is Adj-er than A". Delegates to taller_shorter_antonymy.