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").
- atom {V : Type u_1} {A : Type u_2} : V → Formula V A
- neg {V : Type u_1} {A : Type u_2} : Formula V A → Formula V A
- and {V : Type u_1} {A : Type u_2} : Formula V A → Formula V A → Formula V A
- or {V : Type u_1} {A : Type u_2} : Formula V A → Formula V A → Formula V A
- K {V : Type u_1} {A : Type u_2} : A → Formula V A → Formula V A
- P {V : Type u_1} {A : Type u_2} : A → Formula V A → Formula V A
- B {V : Type u_1} {A : Type u_2} : A → Formula V A → Formula V A
- C {V : Type u_1} {A : Type u_2} : A → Formula V A → Formula V A
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