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