Docs / Semantics / Delineation

Delineation semantics

import Linglib.Semantics.Delineation

In delineation semantics a gradable adjective has no degree argument. A Delineation sends each comparison class, a set of entities the adjective is evaluated against, to disjoint positive and negative extensions relative to it; what lies in neither is the extension gap, the borderline cases. a is taller than b holds when some comparison class puts a in the positive extension and b in the negative one, Klein's development of Kamp's account of the comparative. Under Klein's consistency constraint the ordering this induces is a strict partial order, and under his second constraint any two members of a complete class are equivalent or ranked. A delineation without gaps is complete, and a measure function induces one whose ordering is degree comparison.

Implementation notes

The comparison class of Klein's context is the parameter C of Outranks, and his constraints are imposed on the subclasses of C, ๐’ซ C. A delineation is not required to leave entities outside a class undecided, Klein's restriction of a valuation to its class; the results that need it assume it. Klein's equivalence quantifies over the contexts at least as determinate as the given one, which are here the delineations of an admissible family ๐’Ÿ extending the given one.

References

Declarations

A delineation sends each comparison class to a positive and a negative extension of a gradable adjective relative to it, which are disjoint; what lies in neither is in the extension gap.

structure DelineationL42โ€“52
(E : Type u_1) :
Type u_1
  • pos : Set E โ†’ Set E

    The positive extension relative to a comparison class.

  • neg : Set E โ†’ Set E

    The negative extension relative to a comparison class.

  • disjoint_pos_neg (C : Set E) : Disjoint (self.pos C) (self.neg C)

    Nothing is in both extensions.

Used by Delineation.instCoeFunForallSet, Delineation.instPartialOrder, Delineation.le_def, Delineation.notMem_neg_of_mem, Delineation.IsGapless, Delineation.ofExtension, Delineation.IsGapless.mem_neg_iff, Delineation.IsGapless.eq_of_le, Delineation.Comparative, Delineation.Outranks, Delineation.comparative_iff_outranks_univ, Delineation.IsMonotoneOn, Delineation.IsMonotone, Delineation.Nondistinct, Delineation.IsNontrivialOn, Delineation.IsMonotoneOn.mono, Delineation.Nondistinct.refl, Delineation.Nondistinct.symm, Delineation.Outranks.irrefl, Delineation.IsMonotoneOn.outranks_asymm, Delineation.IsMonotoneOn.outranks_trans, Delineation.IsMonotoneOn.isStrictOrder_outranks, Delineation.IsNontrivialOn.nondistinct_or_outranks_or_outranks, Delineation.Equivalent, Delineation.IsComplete, Delineation.IsLinear, Delineation.equivalent_or_outranks_or_outranks, Delineation.IsGapless.isComplete, Delineation.isLinear_of_forall_isGapless, Delineation.IsGapless.nondistinct_of_not_outranks, Delineation.IsGapless.outranks_cotrans, Delineation.IsGapless.isStrictWeakOrder_outranks, Delineation.IsMonotoneOn.supervaluation_eq_true_of_comparative, Delineation.supervaluation_ne_true_of_comparative, Delineation.ofMeasure, Delineation.very, Delineation.fairly, Delineation.very_subset, Delineation.fairly_disjoint_very, Delineation.preorder, Delineation.preorder_le_iff, Delineation.IsSoundFor, Delineation.IsCompleteFor, Delineation.comparative_iff_of_isSoundFor_of_isCompleteFor

Used in Bochnak2015, Klein1980, RudolphKocurek2024

L66โ€“68
L72โ€“73

Delineations without gaps

L77โ€“79
L85
L90
L94โ€“95
L97โ€“105

The comparative

L111โ€“114
L116โ€“119

Klein's constraints

L126โ€“132
L137โ€“140
L142โ€“147
L155โ€“161

The ordering within a comparison class

L191โ€“205

Equivalence and completeness

L210โ€“214
L217โ€“220

At a class where the delineation is complete and meets Klein's condition (36), any two members are equivalent or ranked one way or the other: the ordering is connected up to equivalence, and with the consistency constraint it is linear (Klein 1980, p. 25).

theorem Delineation.equivalent_or_outranks_or_outranksL226โ€“232
{E : Type u_1} {d : Delineation E} {C : Set E} {u v : E} {๐’Ÿ : Set (Delineation E)} (hc : d.IsComplete ๐’Ÿ C) (hs : d.IsNontrivialOn C) (hu : u โˆˆ C) (hv : v โˆˆ C) :
d.Equivalent ๐’Ÿ C u v โˆจ d.Outranks C u v โˆจ d.Outranks C v u

Built from , , , ,

L240โ€“242
L244โ€“250
L252โ€“258
L260โ€“268

The Fine duality

Comparison classes are specification points: Klein's comparative is the existential dual of Fine's supervaluation.

L279โ€“285
L288โ€“291

The delineation of a measure

ofMeasure maps threshold semantics into delineation semantics, and outranks_ofMeasure_iff says the map is faithful to the comparative.

L304โ€“306
L308โ€“309
L311โ€“312
L314
L316โ€“320
L322โ€“323

Under a measure-induced delineation, the ordering of two members of a comparison class is degree comparison.

theorem Delineation.outranks_ofMeasure_iffL325โ€“333
{E : Type u_1} {C : Set E} {D : Type u_2} [LinearOrder D] (ฮผ : E โ†’ D) {a b : E} (ha : a โˆˆ C) (hb : b โˆˆ C) :
(ofMeasure ฮผ).Outranks C a b โ†” ฮผ b < ฮผ a

Built from ,

Degree modifiers as narrowings of the comparison class

L351โ€“352
L354โ€“355

The equative

L360โ€“363
L365

Faithfulness to a scalar relation

A delineation is sound for a scalar relation R when separation by a comparison class entails R, which is Bochnak's second consistency constraint; it is complete when every pair related by R is separated by some class, closer to Burnett's axioms. Both are classical: under the tolerant semantics of Cobreros and colleagues, similar pairs would defeat strict separation.

L377โ€“380
L388โ€“390
L394โ€“396
L398โ€“400
L402โ€“404