Documentation

Studies.Booth2022b

Booth (2022b): Necessity modals, disjunctions, and collectivity #

[Boo22b] resolves Ross's Puzzle by requiring the alternatives of a necessity modal's prejacent to form a minimal cover of the relevant worlds, not merely a cover: each alternative must be needed, so □(p ∨ q) licenses the Independence inferences ◇(p ∧ ¬q) and ◇(q ∧ ¬p), and the Ross inference from □p to □(p ∨ q) is strongly invalid. The semantics is the bilateral minimal covering semantics of [Boo22a] (the theory-layer MinimalCovering), whose results on atoms this paper restates; its new content is the generalization of the Ross and Independence facts from atoms to arbitrary non-Hurford disjunctions, resting on the compactness of alternatives. The closing reading of □ as a collective predicate of the plurality of propositions a disjunction denotes (§4) is not formalized.

Main results #

Entailment over a model (Def 18) is inclusion of truth sets, and strong invalidity (Def 21) is disjointness of the premises' truth set from the conclusion's.

Implementation notes #

References #

Kratzer's semantics (Def 1) #

theorem Booth2022b.kratzer_monotone {W : Type u_1} (R : W → Set W) :
Monotone fun (A : Set W) => {w : W | R w ⊆ A}

Booth Fact 1: Kratzer's necessity, true at w when R w ⊆ ⟦φ⟧ (Def 1), is upward monotonic, so it validates the Ross inference. Booth's is not (not_monotone_necessity).

theorem Booth2022b.truth_necessity_subset {W : Type u_1} (R : W → Set W) (φ : MinimalCovering.BilatInqProp W) :
(MinimalCovering.necessity R φ).truth ⊆ {w : W | R w ⊆ φ.truth}

A Booth necessity is a Kratzerian one (Def 1): the relevant worlds lie in the truth set of the prejacent.

Booth's necessity is not upward monotonic, unlike Kratzer's (kratzer_monotone): on the model of Figure 1, ⟦p⟧ ⊆ ⟦p ∨ q⟧, yet □p is true and □(p ∨ q) is not.

Non-Hurford disjunctions (Def 22) #

Booth Def 22: φ ∨ ψ is non-Hurford when the positive interpretations of the disjuncts are incomparable.

Equations
Instances For
    theorem Booth2022b.nonHurford_atom_iff {W : Type u_1} {Vp Vq : Set W} :
    NonHurford (MinimalCovering.atom Vp) (MinimalCovering.atom Vq) ↔ IncompRel (fun (x1 x2 : Set W) => x1 ⊆ x2) Vp Vq

    For atoms, Def 22 is [Boo22a]'s admissibility: the truth sets are incomparable.

    theorem Booth2022b.alt_sup_pro_eq_union {W : Type u_1} {φ ψ : MinimalCovering.BilatInqProp W} (hφψ : Disjoint (Kalman.pro φ).alt ↑(Kalman.pro ψ)) (hψφ : Disjoint (Kalman.pro ψ).alt ↑(Kalman.pro φ)) :
    (Kalman.pro (φ ⊔ ψ)).alt = (Kalman.pro φ).alt ∪ (Kalman.pro ψ).alt

    When no alternative of either disjunct is a state of the other, the alternatives of the disjunction are those of the disjuncts.

    The language (Def 8) and compactness (Fact 5) #

    theorem Booth2022b.Formula.eval_neg_neg {W : Type u_1} {At : Type u_2} (V : At → Set W) (R : W → Set W) (φ : MinimalCovering.Formula At) :

    Booth Fact 3, double negation.

    theorem Booth2022b.Formula.fg_eval {W : Type u_1} {At : Type u_2} (V : At → Set W) (R : W → Set W) (φ : MinimalCovering.Formula At) :

    Booth Fact 5, compactness of alternatives: both interpretations of a sentence are finitely generated, so each has finitely many alternatives and is generated by them, ⟦φ⟧° = ↓alt°(⟦φ⟧) (Question.fg_iff_finite_alt_and_isNormal).

    theorem Booth2022b.Formula.truth_necessity_eq {W : Type u_1} {At : Type u_2} (V : At → Set W) (R : W → Set W) (φ : MinimalCovering.Formula At) :

    Def 14's □⁺ clause, with its conjunct R(w) ≠ ∅, agrees with [Boo22a]'s on every sentence: the prejacent has an alternative (Fact 5), and a nonempty family minimally covers only nonempty sets.

    The meta-language Facts 6 and 7 #

    Booth states both facts for every non-Hurford disjunction (Def 22). Their proofs use that no alternative of either disjunct is a state of the other, which is strictly stronger; the facts hold under that condition and fail under Def 22.

    theorem Booth2022b.ross_strongly_invalid_of_alt {W : Type u_1} {φ ψ : MinimalCovering.BilatInqProp W} (hφψ : Disjoint (Kalman.pro φ).alt ↑(Kalman.pro ψ)) (hψφ : Disjoint (Kalman.pro ψ).alt ↑(Kalman.pro φ)) (hψ : (Kalman.pro ψ).alt.Nonempty) (R : W → Set W) :

    Booth Fact 7 (the Ross inference is strongly invalid) under the alternative-wise non-Hurford condition, once ψ has an alternative: alt⁺(⟦φ⟧) is then a proper subfamily of alt⁺(⟦φ ∨ ψ⟧) that still covers the relevant worlds.

    theorem Booth2022b.inter_diff_truth_nonempty_of_alt {W : Type u_1} {φ ψ : MinimalCovering.BilatInqProp W} (hφψ : Disjoint (Kalman.pro φ).alt ↑(Kalman.pro ψ)) (hψφ : Disjoint (Kalman.pro ψ).alt ↑(Kalman.pro φ)) (hφ : (Kalman.pro φ).alt.Nonempty) (hψ : (Kalman.pro ψ).IsNormal) {R : W → Set W} {w : W} (h : w ∈ (MinimalCovering.necessity R (φ ⊔ ψ)).truth) :
    (R w ∩ (φ.truth \ ψ.truth)).Nonempty

    Booth Fact 6 (Independence, meta-language) under the alternative-wise non-Hurford condition: if □(φ ∨ ψ) is true, some relevant world is in the truth set of φ but not of ψ. The alternatives other than a chosen alternative of φ fail to cover the relevant worlds, and the world they miss lies in no state of ψ.

    theorem Booth2022b.Formula.ross_strongly_invalid {W : Type u_1} {At : Type u_2} {V : At → Set W} {R : W → Set W} {φ ψ : MinimalCovering.Formula At} (hφψ : Disjoint (Kalman.pro (MinimalCovering.Formula.eval V R φ)).alt ↑(Kalman.pro (MinimalCovering.Formula.eval V R ψ))) (hψφ : Disjoint (Kalman.pro (MinimalCovering.Formula.eval V R ψ)).alt ↑(Kalman.pro (MinimalCovering.Formula.eval V R φ))) :

    Booth Fact 7 for sentences under the alternative-wise non-Hurford condition; Fact 5 supplies the alternative of ψ.

    theorem Booth2022b.Formula.independence {W : Type u_1} {At : Type u_2} {V : At → Set W} {R : W → Set W} {φ ψ : MinimalCovering.Formula At} (hφψ : Disjoint (Kalman.pro (MinimalCovering.Formula.eval V R φ)).alt ↑(Kalman.pro (MinimalCovering.Formula.eval V R ψ))) (hψφ : Disjoint (Kalman.pro (MinimalCovering.Formula.eval V R ψ)).alt ↑(Kalman.pro (MinimalCovering.Formula.eval V R φ))) {w : W} (h : w ∈ (MinimalCovering.Formula.eval V R (φ.disj ψ).box).truth) :
    (R w ∩ ((MinimalCovering.Formula.eval V R φ).truth \ (MinimalCovering.Formula.eval V R ψ).truth)).Nonempty ∧ (R w ∩ ((MinimalCovering.Formula.eval V R ψ).truth \ (MinimalCovering.Formula.eval V R φ).truth)).Nonempty

    Booth Fact 6 for sentences under the alternative-wise non-Hurford condition; Fact 5 supplies the alternatives and the normality of the disjuncts.

    theorem Booth2022b.not_forall_disjoint_of_nonHurford :
    ¬∀ (W : Type) (R : W → Set W) (φ ψ : MinimalCovering.BilatInqProp W), NonHurford φ ψ → Disjoint (MinimalCovering.necessity R φ).truth (MinimalCovering.necessity R (φ ⊔ ψ)).truth

    Booth Fact 7 as printed, for every non-Hurford disjunction of Def 22, is false: with worlds 0, 1, 2, φ = r₁ ∨ r₂ for V(r₁) = {0}, V(r₂) = {1}, ψ = q for V(q) = {0, 2} and R(0) = {0, 1}, both □φ and □(φ ∨ ψ) are true at 0. The alternative {0} of φ is a state of ψ, which the paper's proof overlooks.

    theorem Booth2022b.not_forall_independence_of_nonHurford :
    ¬∀ (W : Type) (R : W → Set W) (φ ψ : MinimalCovering.BilatInqProp W), NonHurford φ ψ → ∀ w ∈ (MinimalCovering.necessity R (φ ⊔ ψ)).truth, (R w ∩ (φ.truth \ ψ.truth)).Nonempty ∧ (R w ∩ (ψ.truth \ φ.truth)).Nonempty

    Booth Fact 6 as printed, for every non-Hurford disjunction of Def 22, is false: with worlds 0, 1, 2, φ = r for V(r) = {0, 1}, ψ = p ∨ q for V(p) = {0}, V(q) = {1, 2} and R(0) = W, □(φ ∨ ψ) is true at 0 but every world in the truth set of φ is in that of ψ.

    The object-language Facts 7–13 #

    Facts 9–13 are [Boo22a]'s Facts 1, 4, 2, 7 and 6, stated here under Def 22's hypothesis.

    Booth Fact 7 for atoms: the Ross inference □p ∴ □(p ∨ q) is strongly invalid; indeed □p makes □(p ∨ q) neither true nor false (Booth2022a.ross_gap).

    Booth Fact 8: the Extended Ross inference □p, ◇q ∴ □(p ∨ q) is strongly invalid.

    Booth Fact 9, first Independence inference: □(p ∨ q) entails ◇(p ∧ ¬q).

    Booth Fact 9, second Independence inference: □(p ∨ q) entails ◇(q ∧ ¬p).

    Booth Fact 10, Free Choice: ◇(p ∨ q) entails ◇p.

    Booth Fact 10, Free Choice: ◇(p ∨ q) entails ◇q.

    Booth Fact 11, Independence Conditionals: □(p ∨ q) entails ¬p → □q.

    Booth Fact 11, Independence Conditionals: □(p ∨ q) entails ¬q → □p.

    Booth Fact 12, Unnecessity Distribution: ¬□(p ∨ q) entails ¬□p.

    Booth Fact 12, Unnecessity Distribution: ¬□(p ∨ q) entails ¬□q.

    Booth Fact 13, Impossibility Distribution: ¬◇(p ∨ q) entails ¬◇p.

    Booth Fact 13, Impossibility Distribution: ¬◇(p ∨ q) entails ¬◇q.