Docs / Logic / Orthologic / Epistemic / Basic

The epistemic orthologic

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

This file defines Holliday and Mandelkern's epistemic orthologics and proves the least one, EO, sound and complete for epistemic ortholattices. The modal language adds a necessity modal □ to the language of orthologic, with ◇φ := ¬□¬φ. An epistemic orthologic is an orthologic under which □ is monotone, preserves ∧ and ⊤, and is factive, and which satisfies Wittgenstein's Law ¬φ ∧ ◇φ ⊢ ⊥. Over monotonicity and factivity the law is the principle that φ ⊢ ⊥ whenever □φ ⊢ ⊥. The Lindenbaum–Tarski algebra of an epistemic orthologic is an epistemic ortholattice, so the algebraic consequences of the law hold in every epistemic orthologic, among them φ ∧ ◇ⁿ¬φ ⊢ ⊥ for every n.

Implementation notes

IsEpistemicOrthologic F box is a class on any consequence preorder, so Lemma 3.25 and Fact 3.28 hold, as the paper states them, for every epistemic orthologic and not only for EO, whose instance is on ModalFormula.

References

Epistemic orthologics

L43–52

Over an orthologic in which □ is monotone and factive, Wittgenstein's Law holds iff φ ⊢ ⊥ whenever □φ ⊢ ⊥. The forward direction is Holliday & Mandelkern 2024 Lemma 3.25, and the converse is the remark after it, carried out in the proof of Fact 3.28.

theorem wittgenstein_iff_le_bot_of_box_le_botL58–69
{F : Type u_1} [Preorder F] [Top F] [Min F] [Compl F] [IsOrthologic F] {box : F → F} (hmono : Monotone box) (hT : ∀ (φ : F), box φ ≤ φ) :
(∀ (φ : F), φᶜ ⊓ IsEpistemicOrthologic.diamond box φ ≤ ⊤ᶜ) ↔ ∀ (φ : F), box φ ≤ ⊤ᶜ → φ ≤ ⊤ᶜ

Built from

L78–84
L86–87
L105–109

The least epistemic orthologic

L124–131
L145–163
L177–181

Evaluation, soundness and completeness

L202–209
L215
L217
L221–222
L224
L231–242
L281–288