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 ∧ (F ∨ s)) ∧ ¬(F ∨ s)))
⇒ logic.propositional.truezeroand¬(q → p) ↔ ((r ↔ s) ∨ (¬(F ∨ s) ∧ ¬(F ∨ s)))
⇒ logic.propositional.falsezeroor¬(q → p) ↔ ((r ↔ s) ∨ (¬s ∧ ¬(F ∨ s)))