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