Docs / Logic / Orthologic / Epistemic / Compatibility

Modal compatibility frames

import Linglib.Logic.Orthologic.Epistemic.Compatibility · namespace Orthologic

This file defines Holliday and Mandelkern's modal compatibility frames, the possibility semantics for must and might. An accessibility relation $R$ gives the Kripke necessity $\Box A = \{x \mid R(x) \subseteq A\}$, and $\Diamond A = \neg \Box \neg A$ negates with the orthocomplement, so $x$ settles $\Diamond A$ when every possibility compatible with $x$ accesses one compatible with an $A$-possibility. R-regularity is exactly the condition for $\Box$ to preserve regularity, which makes the regular propositions a modal ortholattice. Reflexivity makes it T, as does every possibility accessing one it refines, and over these Knowability is exactly Wittgenstein's Law. Without T, $\neg A$ and $\Diamond^n A$ are disjoint once every $x$ is compatible with a possibility whose $n$-step successors all refine $x$.

Main definitions

Implementation notes

The paper's frame classes are conjunctions of conditions on a bare relation, stated as Prop classes like mathlib's SetRel.IsRefl: a modal compatibility frame is R-regular, a T frame is also reflexive (R.IsRefl), and an epistemic frame also satisfies Knowability. Each theorem assumes only the conditions it uses.

References

Declarations

The possibility ◇A = ¬□¬A negates with the orthocomplement.

def diamondL48–50
{S : Type u_1} (F : Compatibility S) (R : SetRel S S) (A : Set S) :
Set S

Used by instDecidablePredMemSetDiamondOfFintypeOfDecidableRelCompatOfDecidableProdSetRelMk, mem_diamond, diamond_extentClosure, IsRRegular, upperPolar_diamond, disjoint_upperPolar_diamond_iterate, disjoint_upperPolar_diamond, Compatibility.coe_diamondHom_necHom

Used in Logic/Orthologic/Epistemic/Extension, HollidayMandelkern2024

L52–54
L63–66

A relation is R-regular when a possibility accessing one compatible with y is compatible with a possibility according to which y might obtain, one in ◇↓y for ↓y the refinements of y (Holliday & Mandelkern 2024 Definition 4.20).

class IsRRegularL68–73
{S : Type u_1} (F : Compatibility S) (R : SetRel S S) :
  • rRegular (x y' y : S) : (x, y') ∈ R → F.compat y' y → ∃ (x' : S), F.compat x x' ∧ x' ∈ diamond F R ↑(Concept.ofObject F.ortho y)

Built from

Used by isRRegular_iff, isExtent_core, upperPolar_diamond, isRRegular_iff_isExtent_core, Compatibility.necHom, Compatibility.coe_necHom, Compatibility.coe_diamondHom_necHom, Compatibility.necHom_le_of_forall_exists_mem_ofObject, Compatibility.necHom_le, Compatibility.necHom_le_necHom_necHom, Compatibility.isKnowable_iff_wittgensteinLaw, Compatibility.isEpistemic_necHom

Used in Logic/Orthologic/Epistemic/Extension, Logic/Orthologic/Epistemic/FrameSemantics

A relation satisfies Knowability when every possibility x has one at which everything settled true by x is known, since all it accesses refine x (Holliday & Mandelkern 2024 Definition 4.26).

class IsKnowableL84–88
{S : Type u_1} (F : Compatibility S) (R : SetRel S S) :
  • knowable (x : S) : ∃ (y : S), ∀ (z : S), (y, z) ∈ R → z ∈ Concept.ofObject F.ortho x

Used by isKnowable_iff, disjoint_upperPolar_diamond, Compatibility.isKnowable_iff_wittgensteinLaw, Compatibility.isEpistemic_necHom

Used in Logic/Orthologic/Epistemic/Extension, Logic/Orthologic/Epistemic/FrameSemantics

L109–112

When every possibility x is compatible with some y whose possibilities n steps of access away all refine x, ¬A and ◇ⁿA are disjoint for every set A, with neither reflexivity nor R-regularity (Holliday & Mandelkern 2024 Remark 4.28).

theorem disjoint_upperPolar_diamond_iterateL150–159
{S : Type u_1} (F : Compatibility S) (R : SetRel S S) {n : ℕ} (h : ∀ (x : S), ∃ (y : S), F.compat y x ∧ R.image^[n] {y} ⊆ ↑(Concept.ofObject F.ortho x)) (A : Set S) :
Disjoint (upperPolar F.ortho A) ((diamond F R)^[n] A)

Built from

L161–168

The modal ortholattice of regular propositions

F.necHom R is □ on the regular propositions of an R-regular frame, which preserves meets and ⊤ and so makes them the modal ortholattice O(F) of Holliday & Mandelkern 2024 Proposition 4.23.

def Compatibility.necHomL172–178
{S : Type u_1} (F : Compatibility S) (R : SetRel S S) [IsRRegular F R] :
InfTopHom F.Regular F.Regular
  • F.necHom R = { toFun := fun (A : F.Regular) => Concept.ofIsExtent F.ortho (R.core ↑A) ⋯, map_inf' := ⋯, map_top' := ⋯ }

Built from

Used by Compatibility.coe_necHom, Compatibility.coe_diamondHom_necHom, Compatibility.necHom_le_of_forall_exists_mem_ofObject, Compatibility.necHom_le, Compatibility.necHom_le_necHom_necHom, Compatibility.isKnowable_iff_wittgensteinLaw, Compatibility.isEpistemic_necHom

Used in Logic/Orthologic/Epistemic/Extension, Logic/Orthologic/Epistemic/FrameSemantics