Docs / Semantics / Exhaustification / Pruning

Pruning alternatives under the weakening constraint

import Linglib.Semantics.Exhaustification.Pruning · namespace Exhaustification

Pruning replaces the formal alternatives of a sentence by a subset. Crnič, Chemla and Fox constrain it to weaken: the result of exhaustifying over the subset must be entailed by the result over the whole set. Bar-Lev adds that the question under discussion selects, among the readings so derived, the strongest one it determines, and every derived reading is selected by the polar question whether it holds. This is a different constraint from Fox and Katzir's IsAllowableRestriction, which keeps the alternatives that are relevant one by one.

For a disjunction of separated disjuncts with its closure under disjunction as alternatives, a pruning weakens exactly when it makes nothing innocently excludable, so every derived reading is a conjunction of sub-disjunctions; when the disjuncts are independent the derived readings are exactly those conjunctions that are not themselves proper sub-disjunctions, and "at least k of the disjuncts hold" is among them for every k. The question whether at least k ≥ 2 hold determines none of the sub-disjunctions, so a restriction to the alternatives that are relevant one by one would prune them all, though some are needed to derive the reading that question selects.

Implementation notes

The constraint on pruning is stated twice: IsLicensedPruning is the rule, a maximal weakening restriction with a relevant result, and IsPrunedReading is its outcome, the strongest derived reading the question determines. For a disjunction they agree, because two weakening restrictions weaken together and pruning less gives a stronger reading.

References

The weakening constraint

L58–61
L63–65
L67–70
L75–78
L80–82
L88–94

Pruning the sub-disjunctions of a disjunction

L114–117
L119–122
L124–126
L128–133
L142–144
L148–153
L164–168
L172–195

A pruning only weakens exactly when it leaves nothing innocently excludable, and then exhaustification asserts every alternative it keeps.

theorem mem_prunedReadings_iffL197–207
{World : Type u_1} {ι : Type u_2} {I : Finset ι} {p : ι → Set World} (h : Separating I p) (hne : I.Nonempty) {r : Set World} :
r ∈ prunedReadings (supClosure (p '' ↑I)) (⋃ i ∈ I, p i) ↔ ∃ C ⊆ supClosure (p '' ↑I), (∀ (q : Set World), ¬IsInnocentlyExcludable C (⋃ i ∈ I, p i) q) ∧ (⋃ i ∈ I, p i) ∩ ⋂₀ C = r

Built from

L218–223
L225–265
L267–302

When the disjuncts are independent, the readings pruning derives are the conjunctions of sub-disjunctions, barring the sub-disjunctions themselves other than the whole disjunction.

theorem prunedReadings_eqL304–313
{World : Type u_1} {ι : Type u_2} {I : Finset ι} {p : ι → Set World} [DecidableEq ι] (hind : ∀ T ⊆ I, T.Nonempty → ∃ (w : World), ∀ i ∈ I, w ∈ p i ↔ i ∈ T) (hne : I.Nonempty) :
prunedReadings (supClosure (p '' ↑I)) (⋃ i ∈ I, p i) = infClosure (supClosure (p '' ↑I)) \ (supClosure (p '' ↑I) \ {⋃ i ∈ I, p i})

Built from

Threshold readings

L334–339

The question whether at least k ≥ 2 of the disjuncts hold determines no sub-disjunction, so keeping only the alternatives that are relevant one by one prunes them all.

theorem not_determines_polar_atLeastTrueL342–362
{World : Type u_1} {ι : Type u_2} {I : Finset ι} {p : ι → Set World} [(w : World) → (i : ι) → Decidable (w ∈ p i)] (h : Separating I p) (hnone : ∃ (w : World), ∀ i ∈ I, w ∉ p i) {k : ℕ} (hk : 2 ≤ k) {q : Set World} (hq : q ∈ supClosure (p '' ↑I)) :