Docs / Logic / Orthologic / Epistemic / Ortholattice

Epistemic ortholattices

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

This file defines epistemic ortholattices, Holliday and Mandelkern's algebraic semantics for must and might. A modal ortholattice is an ortholattice with a necessity operator □ preserving ⊓ and ⊤, and its possibility operator ◇a = ¬□¬a preserves ⊔ and ⊥. It is epistemic when □a ≤ a (T) and Wittgenstein's Law ¬a ∧ ◇a = 0 holds, which makes "p, but it might be that not p" a contradiction. Over T the law says that a = 0 whenever □a = 0, and it makes every a ∧ ◇ⁿ¬a zero. The law is what forces ortholattices on the account: when ᶜ is a pseudocomplement, as in a Boolean algebra, it makes □ the identity.

Implementation notes

The paper's modal ortholattice is not a new structure: □ is a bundled InfTopHom L L, since one lattice carries many modalities, and IsEpistemic box is the Prop that it is factive and satisfies the law. The frame semantics producing epistemic ortholattices is Logic/Orthologic/Epistemic/Compatibility.lean, and the logic they characterize is Logic/Orthologic/Epistemic/Basic.lean.

References

Declarations

L39–44
L50–52
L54–61
L64–68
L84–87
L92–96

The collapse under pseudocomplementation

The hypothesis hp says that ᶜ is a pseudocomplement, a ⊓ b = ⊥ → b ≤ aᶜ. It holds in every Boolean algebra (Disjoint.le_compl_left), and in an ortholattice it is equivalent to distributivity.

When ᶜ is a pseudocomplement, an epistemic □ is the identity, so a Boolean algebra has no non-trivial epistemic modality.

theorem IsEpistemic.eq_idL152–156
{L : Type u_1} [Lattice L] [BoundedOrder L] [InvolutiveCompl L] {box : InfTopHom L L} (hp : ∀ (a b : L), Disjoint a b → b ≤ aᶜ) (h : IsEpistemic box) :
box = InfTopHom.id L

Built from