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