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