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