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