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