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