Expand description
Modal Logic
This modal logic builds upon the hooo module using Exponential Propositions (HOOO EP).
The Modal Logic variant derived is S5 or stronger for decidable propositions. For more information about variants of Modal Logic, see wikipedia article.
It is currently known that HOOO EP implies S5, but it is unknown whether S5 implies HOOO EP.
Functions
a => □◇a
.□◇a == strong_pos(a)
.¬¬◇a == ¬□¬a
.◇a => □◇a
.□a => □□a
.□(a => b) => (□a => □b)
.□(□p => p)
.(|- a) => (|- □a)
.□¬□⊥
.□¬(¬□⊥ => ¬□¬□⊥)
.□¬(□(□⊥ => ⊥) => □⊥)
.□◇a => strong_pos(a)
.□a => ¬◇¬a
.□a => ◇a
.¬□¬a => ¬¬◇a
.¬□¬a => ◇a
.¬¬◇a => ¬□¬a
.¬(false^a) => ◇a
.¬◇a => false^a
.¬◇a => ◇¬a
.¬◇¬a => □a
.⊥^(¬□⊥ => ¬□¬□⊥)
.⊥^(□(□⊥ => ⊥) => □⊥)
.false^(false^a) => ◇a
.false^a => ¬◇a
.◇a => ¬□¬a
.◇a => ¬(false^a)
.◇a => false^(false^a)
.◇¬a => ¬◇a
.strong_pos(a) => □◇a
.□a => a
.a => ¬¬◇a
.
Type Definitions
¬¬◇p
.□p := p^true
.◇p := p^true ⋁ theory(p)
.strong_pos(a) := p^true ⋁ false^(p^true ⋁ false^p)
.