Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished
F ∨ (¬¬¬(¬(T ∧ q) ∨ p) ↔ ((r ↔ s) ∨ ¬s))
⇒ logic.propositional.notnotF ∨ (¬(¬(T ∧ q) ∨ p) ↔ ((r ↔ s) ∨ ¬s))
⇒ logic.propositional.truezeroandF ∨ (¬(¬q ∨ p) ↔ ((r ↔ s) ∨ ¬s))
⇒ logic.propositional.demorganorF ∨ ((¬¬q ∧ ¬p) ↔ ((r ↔ s) ∨ ¬s))
⇒ logic.propositional.notnotF ∨ ((q ∧ ¬p) ↔ ((r ↔ s) ∨ ¬s))