Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
![](http://ideas.cs.uu.nl/images/external.png)
F ∨ ((F ∨ ¬(q → p)) ↔ ((r ↔ (s ∨ F)) ∨ ¬s))
⇒ logic.propositional.defimplF ∨ ((F ∨ ¬(¬q ∨ p)) ↔ ((r ↔ (s ∨ F)) ∨ ¬s))
⇒ logic.propositional.demorganorF ∨ ((F ∨ (¬¬q ∧ ¬p)) ↔ ((r ↔ (s ∨ F)) ∨ ¬s))
⇒ logic.propositional.falsezeroorF ∨ ((¬¬q ∧ ¬p) ↔ ((r ↔ (s ∨ F)) ∨ ¬s))
⇒ logic.propositional.notnotF ∨ ((q ∧ ¬p) ↔ ((r ↔ (s ∨ F)) ∨ ¬s))