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