Docs / Semantics / Exhaustification / Closure

Exhaustification and the closure of the alternatives

import Linglib.Semantics.Exhaustification.Closure · namespace Exhaustification

Closing the alternatives under conjunction and disjunction, or under any part of that closure, leaves the minimal worlds unchanged, since it leaves unchanged how the alternatives rank worlds. Innocent exclusion is not invariant in that way, but closing the alternatives under disjunction leaves it unchanged, and alternatives that include every conjunction of finitely many propositions and are built from them by conjunction and disjunction give it the minimal worlds over those propositions. Finitely many alternatives closed under conjunction are the case where the propositions are the alternatives themselves.

Implementation notes

The closure under conjunction and disjunction is latticeClosure, the closure under finite meets and joins, where Spector 2016 closes under the conjunction and disjunction of arbitrary subsets; the closures under disjunction alone and conjunction alone are stated for arbitrary subsets.

References

Declarations

L40–46
L48–52
L54–58

Closing the alternatives under conjunction and disjunction, or under any part of that closure, leaves the minimal worlds unchanged (Spector 2016): the propositions true at v whenever they are true at u form a sublattice.

theorem exhMW_eq_of_subset_latticeClosureL61–69
{World : Type u_1} {ALT : Set (Set World)} {φ : Set World} {S : Set (Set World)} (h₁ : S ⊆ ALT) (h₂ : ALT ⊆ latticeClosure S) :
exhMW ALT φ = exhMW S φ
L71–72

Alternatives that include every conjunction of finitely many propositions E, and are built from E by conjunction and disjunction, give innocent exclusion the minimal worlds over E (Spector 2016). A prejacent world above another verifies the conjunction of the members of E true at it, which every minimal world falsifies.

theorem exhIE_eq_exhMW_of_infClosure_subsetL75–98
{World : Type u_1} {ALT : Set (Set World)} {φ : Set World} {E : Set (Set World)} (hfin : E.Finite) (h₁ : infClosure E ⊆ ALT) (h₂ : ALT ⊆ latticeClosure E) :
exhIE ALT φ = exhMW E φ

With finitely many alternatives closed under conjunction the two exhaustifiers coincide.

theorem exhMW_eq_exhIE_of_infClosedL100–103
{World : Type u_1} (ALT : Set (Set World)) (φ : Set World) (hfin : ALT.Finite) (hinf : InfClosed ALT) :
exhMW ALT φ = exhIE ALT φ

Innocent exclusion is unchanged by closing the alternatives under disjunction, since a disjunction fails at every minimal world iff each disjunct does.

theorem exhIE_sUnion_image_powersetL105–118
{World : Type u_1} (ALT : Set (Set World)) (φ : Set World) :
exhIE (Set.sUnion '' 𝒫 ALT) φ = exhIE ALT φ
L120–123
L125–129