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