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