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