Docs / Semantics / Quantification / Predicative

Predicative content

import Linglib.Semantics.Quantification.Predicative · namespace Quantifier

BE, Montague's translation of be recast by Partee as a type shift, takes a quantifier to the individuals whose singleton it contains. It is a complete homomorphism, the only one taking each individual to its singleton, and the existential determiner Det.some, Partee's A, is a section of it, the only conservative, symmetric, monotone one; on the monotone quantifiers the two form a Galois coinsertion. On an intersective determiner BE asks of an individual only about the restrictor there. Be the A holds of the only A, as be every A does once there is an A, and read at each index it is a role that no set represents.

Implementation notes

Fact 2 of Partee 1987, the uniqueness of BE, is stated for complete homomorphisms: on an infinite domain a Boolean homomorphism can agree with BE on the individuals and differ elsewhere (Studies/Partee1987.lean).

References

BE and its sections

BE Q is the predicative content of the quantifier Q, BE(Q) = {x | Q {x}}, which preserves arbitrary meets and joins.

def BEL40–45
{E : Type u_1} :
CompleteLatticeHom (Quantifier E) (Set E)
  • BE = { toFun := fun (Q : Quantifier E) => {x : E | Q {x}}, map_sInf' := ⋯, map_sSup' := ⋯ }

Used by mem_BE, BE_individual, BE_some, some_BE_eq_self_iff, BE_unique, eq_some_of_leftInverse, Det.Intersective.mem_BE, iota_BE_individual, mem_BE_the, BE_the_of_subsingleton, BE_every_of_nonempty, BE_the_not_mem_range_const, individual_le_iff, some_le_iff, gciSomeBE

Used in Semantics/Aspect/SubintervalProperty, Semantics/Quantification/Numerals/Basic, BylininaNouwen2020, Partee1987

L47
L52–54

BE of an intersective determiner, which looks only at A ∩ B, asks of an entity x only about A ∩ {x}. For one that is also quantity invariant, as the weak determiners are, the predicative reading is the noun, its complement or a constant.

theorem Det.Intersective.mem_BEL82–87
{E : Type u_1} {D : Det E} (hD : D.Intersective) {A : Set E} {x : E} :
x ∈ BE (D A) ↔ D (A ∩ {x}) (A ∩ {x})

Built from

The definite article

L99–102

The predicative definite read at each index is the role of being the only P there, which no set read at every index represents once the referent changes: the owner of this land as a predicate depends on who owns it where (Partee 1987, fn. 16).

theorem BE_the_not_mem_range_constL108–119
{E : Type u_1} {W : Type u_2} {P : W → Set E} {w₀ w₁ : W} {a b : E} (h₀ : P w₀ = {a}) (h₁ : P w₁ = {b}) (hab : a ≠ b) :
(fun (w : W) => BE (Det.the (P w))) ∉ Set.range (Function.const W)

Built from

The Galois coinsertion on monotone quantifiers

L132–135

Images

L151–155
L161–165