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