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