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