Documentation

Linglib.Core.Logic.Modal.QBSML.FreeChoice

QBSML free-choice facts #

[AvO23] [Alo22]

The free-choice, ignorance, distribution and negation facts of QBSML ([AvO23] §5), as universal theorems over arbitrary QBSML models — the framework's account of why pragmatically enriched disjunctions under modals license both disjuncts:

FactStatement
3[Pa ∨ Pb]⁺ ⊨_epi ◇Pa ∧ ◇Pb (ignorance, R state-based)
5card(s)=1 ⇒ M, s ⊨ [∀x(Px ∨ Qx)]⁺ ⇒ M, s ⊨ ∃xPx ∧ ∃xQx
6[∀x(Px ∨ Qx)]⁺ ⊨_epi ∃x◇Px ∧ ∃x◇Qx (distribution°)
7[□(Pa ∨ Pb)]⁺ ⊨ ◇Pa ∧ ◇Pb (□-free choice)
8[◇(Pa ∨ Pb)]⁺ ⊨ ◇Pa ∧ ◇Pb (◇-free choice)
9[∀x◇(Px ∨ Qx)]⁺ ⊨ ∀x◇Px ∧ ∀x◇Qx (universal FC; [Che09b])
10[¬(Pa ∨ Pb)]⁺ ⊨ ¬Pa ∧ ¬Pb (negation; ignorance disappears)

plus the quantified □-FC composite [□∃x(α ∨ β)]⁺ ⊨ ◇∃xα ∧ ◇∃xβ (boxExiFC_Q) behind [Yan23]'s Asher and Heim solutions. Fact 4 (obviation) is a countermodel claim and lives with the concrete model in Studies/AloniVanOrmondt2023.lean, which also instantiates the facts here.

Main declarations #

Proof architecture #

  1. Enrichment strengthens (enrichment_strengthens_support, Core/Logic/Modal/QBSML/Enrichment.lean): the enriched form entails the original on the NE-free fragment.
  2. Diamond split (diamond_split): the split t₁ ∪ t₂ = modalLift X g supports the enriched disjuncts on its pieces; State.modalLift_worldProj_of_subset recovers each piece from its world projection, which serves as the Finset W witness.
  3. NE strips: support_enrich_nec_iff peels the derived 's enrichment; antiSupport_strip_ne the remaining NE conjuncts.
  4. Witness reconstruction (support_exi_of_update_closure, Core/Logic/Modal/QBSML/Properties.lean): existential witnesses for the quantified facts.

The negation fact requires no frame condition on R ([AvO23] page 564 proof of Fact 10: "Assume M, s ⊨ [¬(Pa ∨ Pb)]⁺. It follows that s ≠ ∅ and M, s ⫤ [Pa ∨ Pb]⁺" — frame conditions on R are not invoked); Facts 7 and the quantified composite hold with the derived even though its enrichment differs from the paper's primitive [□φ]⁺ = □[φ]⁺ ∧ NE.

The diamond split #

theorem Core.Logic.Modal.QBSML.diamond_split {W : Type u_1} {Var : Type u_2} {Domain : Type u_3} {Const : Type u_4} {Pred : Type u_5} [DecidableEq W] [DecidableEq Var] [Fintype Var] [DecidableEq Domain] [Fintype Domain] (M : QBSMLModel W Domain Const Pred) {α β : QBSMLFormula Var Const Pred} ( : α.IsNEFree) ( : β.IsNEFree) {X : Finset W} {g : Assignment Var Domain} (hsupp : support M (α.disj β).enrich (State.modalLift X g)) :
(∃ YX, Y.Nonempty support M α (State.modalLift Y g)) YX, Y.Nonempty support M β (State.modalLift Y g)

The shared core of the free-choice facts: an enriched split disjunction supported on a modal pairing yields a non-empty world-set witness for each disjunct. The split t₁ ∪ t₂ = modalLift X g supports the enriched disjuncts on its pieces; State.modalLift_worldProj_of_subset recovers each piece from its world projection, which serves as the Finset W witness, and enrichment_strengthens_support discharges the enrichment to plain support of α, β.

theorem Core.Logic.Modal.QBSML.possFC_on {W : Type u_1} {Var : Type u_2} {Domain : Type u_3} {Const : Type u_4} {Pred : Type u_5} [DecidableEq W] [DecidableEq Var] [Fintype Var] [DecidableEq Domain] [Fintype Domain] (M : QBSMLModel W Domain Const Pred) {α β : QBSMLFormula Var Const Pred} ( : α.IsNEFree) ( : β.IsNEFree) {t : Finset (Index W Var Domain)} (h : support M (α.disj β).enrich.poss t) :
support M α.poss t support M β.poss t

Per-index form of the core: a state whose every index sees an enriched split disjunction supports both diamonds (shared by Facts 8 and 9).

Free choice (Facts 7, 8 and 9) #

theorem Core.Logic.Modal.QBSML.narrowScopeFC_Q {W : Type u_1} {Var : Type u_2} {Domain : Type u_3} {Const : Type u_4} {Pred : Type u_5} [DecidableEq W] [DecidableEq Var] [Fintype Var] [DecidableEq Domain] [Fintype Domain] (M : QBSMLModel W Domain Const Pred) (α β : QBSMLFormula Var Const Pred) (s : Finset (Index W Var Domain)) ( : α.IsNEFree) ( : β.IsNEFree) (h : support M (α.disj β).poss.enrich s) :
support M α.poss s support M β.poss s

Fact 8 (◇-free choice / narrow-scope FC) of [AvO23] (the first-order analogue of [Alo22] Fact 4):

[◇(α ∨ β)]⁺ ⊨ ◇α ∧ ◇β for NE-free α, β.

Projects the diamond clause of the enrichment and applies the per-index core possFC_on at s.

theorem Core.Logic.Modal.QBSML.universalFC_Q {W : Type u_1} {Var : Type u_2} {Domain : Type u_3} {Const : Type u_4} {Pred : Type u_5} [DecidableEq W] [DecidableEq Var] [Fintype Var] [DecidableEq Domain] [Fintype Domain] (M : QBSMLModel W Domain Const Pred) (α β : QBSMLFormula Var Const Pred) (x : Var) (s : Finset (Index W Var Domain)) ( : α.IsNEFree) ( : β.IsNEFree) (h : support M (QBSMLFormula.univ x (α.disj β).poss).enrich s) :

Fact 9 (universal free choice) of [AvO23], the pattern attested experimentally by [Che09b]:

[∀x◇(α ∨ β)]⁺ ⊨ ∀x◇α ∧ ∀x◇β for NE-free α, β.

The enriched premise evaluates the enriched diamond at the universal extension s[x], so the conclusion is possFC_on at s[x] — the same per-index argument as Fact 8, one extension up.

theorem Core.Logic.Modal.QBSML.boxFC_Q {W : Type u_1} {Var : Type u_2} {Domain : Type u_3} {Const : Type u_4} {Pred : Type u_5} [DecidableEq W] [DecidableEq Var] [Fintype Var] [DecidableEq Domain] [Fintype Domain] (M : QBSMLModel W Domain Const Pred) (α β : QBSMLFormula Var Const Pred) (s : Finset (Index W Var Domain)) ( : α.IsNEFree) ( : β.IsNEFree) (h : support M (α.disj β).nec.enrich s) :
support M α.poss s support M β.poss s

Fact 7 (□-free choice) of [AvO23]:

[□(α ∨ β)]⁺ ⊨ ◇α ∧ ◇β for NE-free α, β.

is derived (QBSMLFormula.nec), so the enrichment here is the negation-clause enrichment of ¬◇¬(α ∨ β) rather than the paper's primitive [□φ]⁺ = □[φ]⁺ ∧ NE — but the fact holds all the same: support_enrich_nec_iff puts the enriched disjunction on each index's full accessible lift R(wᵢ)[gᵢ], and diamond_split produces the witnesses.

Quantified □-free choice #

[□∃x(α ∨ β)]⁺ ⊨ ◇∃xα ∧ ◇∃xβ — the composite of Fact 7 with an existential under the modal, which is the form [Yan23]'s Asher and Heim solutions invoke (its §4.4.3; see Studies/Yan2023.lean).

theorem Core.Logic.Modal.QBSML.boxExiFC_Q {W : Type u_1} {Var : Type u_2} {Domain : Type u_3} {Const : Type u_4} {Pred : Type u_5} [DecidableEq W] [DecidableEq Var] [Fintype Var] [DecidableEq Domain] [Fintype Domain] (M : QBSMLModel W Domain Const Pred) (α β : QBSMLFormula Var Const Pred) (x : Var) (s : Finset (Index W Var Domain)) ( : α.IsNEFree) ( : β.IsNEFree) (h : support M (QBSMLFormula.exi x (α.disj β)).nec.enrich s) :

Quantified □-free choice: [□∃x(α ∨ β)]⁺ ⊨ ◇∃xα ∧ ◇∃xβ for NE-free α, β. The shape behind [Yan23]'s Asher and Heim solutions: the enriched premise puts the enriched split disjunction on each index's full accessible lift's functional extension; each non-empty half yields a ◇∃x-witness by poss_exi_of_subset_extendFunctional.

Ignorance (Fact 3) #

theorem Core.Logic.Modal.QBSML.ignorance_Q {W : Type u_1} {Var : Type u_2} {Domain : Type u_3} {Const : Type u_4} {Pred : Type u_5} [DecidableEq W] [DecidableEq Var] [Fintype Var] [DecidableEq Domain] [Fintype Domain] (M : QBSMLModel W Domain Const Pred) (P Q : Pred) (c₁ c₂ : Const) (s : Finset (Index W Var Domain)) (hSB : FirstOrder.Language.KripkeStructure.IsStateBased M s) (h : support M ((QBSMLFormula.predc P c₁).disj (QBSMLFormula.predc Q c₂)).enrich s) :

Fact 3 (ignorance) of [AvO23]: on epistemic models (state-based R),

[Pc₁ ∨ Qc₂]⁺ ⊨_epi ◇Pc₁ ∧ ◇Qc₂.

Stated for constant atoms, as in the paper's Pa ∨ Pb: the proof transplants each split-half's worlds to every index via state-basedness, which is sound only because constant atoms are assignment-invariant — with a free variable in place of the constant the statement is false (the transplanted indices carry the wrong assignments).

Negation behaviour (Fact 10) #

theorem Core.Logic.Modal.QBSML.negationStrip_Q {W : Type u_1} {Var : Type u_2} {Domain : Type u_3} {Const : Type u_4} {Pred : Type u_5} [DecidableEq W] [DecidableEq Var] [Fintype Var] [DecidableEq Domain] [Fintype Domain] (M : QBSMLModel W Domain Const Pred) (α β : QBSMLFormula Var Const Pred) (s : Finset (Index W Var Domain)) ( : α.IsNEFree) ( : β.IsNEFree) (h : support M (α.disj β).neg.enrich s) :
support M α.neg s support M β.neg s

Fact 10 (negation behaviour) of [AvO23]:

[¬(α ∨ β)]⁺ ⊨ ¬α ∧ ¬β for NE-free α, β.

Three NE-strips compose: outer (¬enrich(α ∨ β)) ∧ NE, then disj-anti splits to (antiSupport enrich α) ∧ (antiSupport enrich β), then enrichment_strengthens_antiSupport for each disjunct.

No frame condition on R — the proof goes through for every model. Negation cancels ignorance (paper §5.5): the Nonempty hypothesis is discharged by the three NE-strips, leaving classical anti-support on each disjunct.

Distribution (Facts 5 and 6) #

theorem Core.Logic.Modal.QBSML.distribution_Q {W : Type u_1} {Var : Type u_2} {Domain : Type u_3} {Const : Type u_4} {Pred : Type u_5} [DecidableEq W] [DecidableEq Var] [Fintype Var] [DecidableEq Domain] [Fintype Domain] (M : QBSMLModel W Domain Const Pred) (α β : QBSMLFormula Var Const Pred) (x : Var) (i : Index W Var Domain) ( : α.IsNEFree) ( : β.IsNEFree) (h : support M (QBSMLFormula.univ x (α.disj β)).enrich {i}) :
support M (QBSMLFormula.exi x α) {i} support M (QBSMLFormula.exi x β) {i}

Fact 5 (distribution at maximal information) of [AvO23]: on a state of maximal information (card s = 1, here s = {i}),

[∀x(α ∨ β)]⁺ ⊨ ∃xα ∧ ∃xβ for NE-free α, β.

The enriched premise splits the universal extension {i}[x] into non-empty parts supporting the enriched disjuncts; because the state is a singleton, every part extends the same index, so each part is the image of a functional extension witnessing the existential.

theorem Core.Logic.Modal.QBSML.distributionEpi_Q {W : Type u_1} {Var : Type u_2} {Domain : Type u_3} {Const : Type u_4} {Pred : Type u_5} [DecidableEq W] [DecidableEq Var] [Fintype Var] [DecidableEq Domain] [Fintype Domain] (M : QBSMLModel W Domain Const Pred) (P Q : Pred) (x : Var) (s : Finset (Index W Var Domain)) (hSB : FirstOrder.Language.KripkeStructure.IsStateBased M s) (h : support M (QBSMLFormula.univ x ((QBSMLFormula.pred P x).disj (QBSMLFormula.pred Q x))).enrich s) :

Fact 6 (distribution°) of [AvO23]: on epistemic models (state-based R),

[∀x(Px ∨ Qx)]⁺ ⊨ ∃x◇Px ∧ ∃x◇Qx.

Stated for atoms, as in the paper (the proof evaluates the atom pointwise at a single transplanted world; the paper notes the result "can easily be generalised", which for arbitrary NE-free formulas would route through flatness).