Docs / Semantics / Degree / Quantifier

Degree quantifiers

import Linglib.Semantics.Degree.Quantifier · namespace Degree

This file defines the denotations of degree phrases as quantifiers over degrees and their scope relative to a quantifier over entities or worlds. A degree phrase says that the maximum of its degree predicate lies in an interval, MaxIn U X; under a quantifier Q it scopes low, applied to each entity's own degree property, or high, applied to scopeDegrees Q P, the degrees at which Q holds. A measure μ gives each entity the degrees it reaches, Iic ∘ μ, and under some the degree set is then the lower closure of the measures, the than-clause degree set. The max-quantified comparative MaxComparative c compares a matrix witness with its greatest measure by the comparison c.

Main definitions

  • MaxIn U X: the greatest element of X lies in U.
  • scopeDegrees Q P: the degrees d such that Q holds of the entities x with d ∈ P x.
  • LowScope 𝒟 Q P, HighScope 𝒟 Q P: the degree quantifier 𝒟 under and over Q.
  • MaxComparative c P Q μ: the max-quantified comparative, the equative at c = .ge.
  • AbsoluteSuperlative μ C x: x measures above every other member of C.

Main results

Implementation notes

A measured degree property Iic (μ x) is a principal lower set and contains the bottom degree; the structural lemmas ask only that each degree property be a lower set. For a count, the cardinalities of the pluralities a numeral ranges over, Iic is pluralization with the empty sum (Mereology.card_image_fullAlgClosure); Link's pluralization, without it, gives Icc 1 n (Mereology.card_image_algClosure), and a collective predicate need give no lower set.

References

Degree quantifiers and their scope

An entity's degree property is the set of degrees at which the scope holds of it, the degree predicate λd. φ(d)(x); for a measure μ it is Iic ∘ μ, the degrees the entity reaches.

The degrees at which Q holds of the entities whose degree property contains them, the degree predicate abstracted over the scope of Q.

def scopeDegreesL77–79
{α : Type u_1} {D : Type u_2} (Q : Quantifier α) (P : α → Set D) :
Set D

Used by mem_scopeDegrees, HighScope, scopeDegrees_some, scopeDegrees_every, scopeDegrees_no, scopeDegrees_some_Iic, scopeDegrees_every_Iic, isLowerSet_scopeDegrees, isUpperSet_scopeDegrees, not_isGreatest_scopeDegrees, scopeDegrees_eq_Iic, exists_isGreatest_scopeDegrees, highScope_maxIn_Iio_iff, isGreatest_scopeDegrees_of_inf, isGLB_compl_scopeDegrees, isGLB_compl_scopeDegrees_iff

Used in BeckOdaSugisaki2004, Heim2001

L81

A degree quantifier 𝒟 scoping under Q, applied to each entity's own degree property.

def LowScopeL83–85
{α : Type u_1} {D : Type u_2} (𝒟 : Set D → Prop) (Q : Quantifier α) (P : α → Set D) :
  • LowScope 𝒟 Q P = Q {x : α | 𝒟 (P x)}

Used by lowScope_maxIn, lowScope_of_highScope, highScope_every_of_lowScope, lowScope_some_of_highScope, highScope_of_lowScope, highScope_maxIn_iff_lowScope

Used in BeckOdaSugisaki2004, BylininaNouwen2018, BylininaNouwen2020, Heim2001, Kennedy2015 and 1 more

A degree quantifier 𝒟 scoping over Q.

def HighScopeL87–89
{α : Type u_1} {D : Type u_2} (𝒟 : Set D → Prop) (Q : Quantifier α) (P : α → Set D) :

Built from

Used by lowScope_of_highScope, highScope_every_of_lowScope, highScope_maxIn_singleton_every, highScope_maxIn_singleton_some, lowScope_some_of_highScope, highScope_of_lowScope, highScope_maxIn_iff_lowScope, highScope_maxIn_Iio_iff

Used in BeckOdaSugisaki2004, BylininaNouwen2018, BylininaNouwen2020, Heim2001, Kennedy2015 and 1 more

The greatest element of P lies in U. These are the degree quantifiers of Heim 2001, -er than t at U = Ioi t, less than t at Iio t, exactly δ -er than t at {t + δ}, and the equative at Ici t.

def MaxInL110–113
{D : Type u_2} [Preorder D] (U X : Set D) :
  • MaxIn U X = ∃ m ∈ U, IsGreatest X m

Used by maxIn_singleton, maxIn_Iic, maxIn_compl, lowScope_maxIn, lowScope_of_highScope, highScope_every_of_lowScope, highScope_maxIn_singleton_every, highScope_maxIn_singleton_some, lowScope_some_of_highScope, highScope_of_lowScope, highScope_maxIn_iff_lowScope, highScope_maxIn_Iio_iff

Used in Semantics/Quantification/Numerals/Basic, BeckOdaSugisaki2004, BylininaNouwen2018, BylininaNouwen2020, Heim2001 and 2 more

L115
L127–129
L131–133

Under an antitone quantifier, negation, at most n or refuse, the degree set has no maximum on a scale without a top, so the high-scope reading is a presupposition failure.

theorem not_isGreatest_scopeDegreesL135–139
{α : Type u_1} {D : Type u_2} [Preorder D] {Q : Quantifier α} {P : α → Set D} [NoMaxOrder D] (hQ : Antitone Q) (hP : ∀ (x : α), IsLowerSet (P x)) :
¬∃ (m : D), IsGreatest (scopeDegrees Q P) m

Built from

L141–144
L151–152
L154–156
L158–159
L161–163
L193–209
L211–219

Over a monotone quantifier on a finite domain, a degree quantifier at an upper set, comparative or equative, takes scope without truth-conditional effect.

theorem highScope_maxIn_iff_lowScopeL221–225
{α : Type u_1} {D : Type u_2} [LinearOrder D] {U : Set D} {Q : Quantifier α} {μ : α → D} [Finite α] (hQ : Monotone Q) (hQ₀ : ¬Q ⊥) (hU : IsUpperSet U) :
HighScope (MaxIn U) Q (Set.Iic ∘ μ) ↔ LowScope (MaxIn U) Q (Set.Iic ∘ μ)

Built from , ,

L227–234

Under the meet of a quantifier with an antitone one, exactly n as at least n and at most n, the maximum of the degree set, when defined, is that of the other conjunct, so high-scope exactly two girls are taller than t means at least two.

theorem isGreatest_scopeDegrees_of_infL236–243
{α : Type u_1} {D : Type u_2} [LinearOrder D] {Q Q' : Quantifier α} {P : α → Set D} (hQ' : Antitone Q') (hP : ∀ (x : α), IsLowerSet (P x)) {m : D} (h : IsGreatest (scopeDegrees (Q ⊓ Q') P) m) :
IsGreatest (scopeDegrees Q P) m

Built from

L245–249
L251–255

The max-quantified comparative

The clausal comparative of von Stechow and Rullmann: some matrix witness stands in a comparison to the greatest measure of the than-clause witnesses, more P than Q at .gt and as P as Q at .ge. Matrix and than-clause restrictions are independent predicates over a witness sort, so heterogeneous comparatives are the general case.

The max-quantified comparative under the comparison c holds when the measures of the Q-witnesses have a greatest element δ and the measure of some P-witness stands in c to δ.

def MaxComparativeL269–273
{α : Type u_1} {D : Type u_2} [Preorder D] (c : Comparison) (P Q : α → Prop) (μ : α → D) :
  • MaxComparative c P Q μ = ∃ (δ : D), IsGreatest (μ '' {x : α | Q x}) δ ∧ ∃ (x : α), P x ∧ c.Rel (μ x) δ

Used by MaxComparative.mono, MaxComparative.exists_lt, MaxComparative.trans, maxComparative_iff_of_unique, maxComparative_eq_iff, maxComparative_gt_iff_of_isGreatest, MaxComparative.antisymm, maxComparative_ge_total, maxComparative_gt_trichotomy, maxComparative_gt_iff_gtOverSet, maxComparative_comp

Used in Bale2008, CarianiSantorioWellwood2023, CarianiSantorioWellwood2024, Heim2001, Pasternak2019 and 1 more

L275–280
L282–285

Under unique matrix and than-clause witnesses, the max-quantified comparative compares their measures directly.

theorem maxComparative_iff_of_uniqueL295–304
{α : Type u_1} {D : Type u_2} [Preorder D] {c : Comparison} {P Q : α → Prop} {μ : α → D} {xa xb : α} (ha : P xa) (ha_unique : ∀ (x : α), P x → x = xa) (hb : Q xb) (hb_unique : ∀ (x : α), Q x → x = xb) :
MaxComparative c P Q μ ↔ c.Rel (μ xa) (μ xb)

Built from

L306–308
L310–316

Set-of-degrees comparative

The S-comparative of Hoeksema 1983 generalizes the point-standard comparative from a single standard to a degree-set standard. Its extension is μ ⁻¹' strictUpperBounds Δ, the entities measuring above every standard degree, and the binary comparator is its singleton case (strictUpperBounds_singleton).

L360–361
L372–377

Superlatives

-est universally quantifies the comparative over a comparison class (Heim 1999), the semantic reflex of Bobaljik 2012's containment [[[ADJ] CMPR] SPRL].

L398–401

Change of scale