Docs / Logic / Epistemic / Basic

The language of knowledge and belief

import Linglib.Logic.Epistemic.Basic · namespace EpistemicLogic

This file defines the propositional language of knowledge and belief, with operators for what each agent knows and believes and their duals, and its possible-worlds semantics. A model has, for each agent, an epistemic and a doxastic alternativeness relation, the doxastic alternatives among the epistemic ones, and knowing and believing are necessity along them, the box ModalLogic.Box of the attitude semantics in Semantics/Attitudes/Doxastic.lean.

Main definitions

Main results

Implementation notes

The frame conditions every model shares are fields. Transitivity, the condition Hintikka trades for his (C.KK*) and (C.BB*), is left to SetRel.IsTrans instances, so that a result which does not need it is stated without it.

References

Declarations

The formulas of the language of knowledge and belief: atomic sentences, negation, conjunction, disjunction and the epistemic operators K a ("a knows that"), P a ("it is possible, for all that a knows, that"), B a ("a believes that") and C a ("it is compatible with everything a believes that").

inductive FormulaL44–57
(V : Type u_1) (A : Type u_2) :
Type (max u_1 u_2)

Derives DecidableEq.

Used by Formula.imp, Formula.knowsWhether, Formula.notKnowsWhether, Model.Sat, Model.truthSet, Model.decSat, Model.instDecidableSat, Model.instDecidableMemFormulaSetTruthSet, Model.sat_withPredecessor, Model.sat_withPredecessor_none_neg_B

Used in Gazdar1979, Hintikka1962, Yalcin2007

L63–64
L73

A possible-worlds model of the epistemic language.

structure ModelL87–100
(V : Type u_3) (A : Type u_4) (W : Type u_5) :
Type (max (max u_3 u_4) u_5)
  • epi : A → SetRel W W

    Epistemic alternativeness.

  • dox : A → SetRel W W

    Doxastic alternativeness.

  • val : V → W → Prop

    Valuation of the atomic sentences.

  • epi_refl (a : A) : (self.epi a).IsRefl

    Whatever is known is true.

  • dox_serial (a : A) : ModalLogic.IsSerial (self.dox a)

    Some state of affairs is compatible with what each agent believes.

  • dox_le_epi (a : A) : self.dox a ⊆ self.epi a

    Doxastic alternatives are epistemic alternatives: what is known is believed.

Used by Model.Sat, Model.truthSet, Model.decSat, Model.instDecidableSat, Model.instDecidableMemFormulaSetTruthSet, Model.withPredecessor, Model.instIsTransOptionEpiWithPredecessor, Model.instIsTransOptionDoxWithPredecessor, Model.sat_withPredecessor, Model.sat_withPredecessor_none_neg_B

Used in Gazdar1979, Hintikka1962

Satisfaction: the epistemic operators are box and diamond over the agent's alternativeness.

def Model.SatL106–116
{V : Type u_1} {A : Type u_2} {W : Type u_3} (M : Model V A W) :
Formula V A → W → Prop
Equations

Built from ,

Used by Model.truthSet, Model.decSat, Model.instDecidableSat, Model.sat_withPredecessor, Model.sat_withPredecessor_none_neg_B

Used in Gazdar1979, Hintikka1962

Decidability over finitely many worlds

L128–137
L139
L141

A world before a world

A model with a new world whose alternatives are those of a given world w₀ together with w₀ itself evaluates every formula at the old worlds as before, since no old world sees the new one; the new world does not believe what fails at w₀.

M with a new world placed before w₀: its epistemic alternatives are itself and those of w₀, and its doxastic alternatives w₀ and those of w₀.

def Model.withPredecessorL151–175
{V : Type u_1} {A : Type u_2} {W : Type u_3} (M : Model V A W) (w₀ : W) :
Model V A (Option W)

The definition is too large to print here; read it in the source.

Built from

Used by Model.instIsTransOptionEpiWithPredecessor, Model.instIsTransOptionDoxWithPredecessor, Model.sat_withPredecessor, Model.sat_withPredecessor_none_neg_B

L179–182
L184–188