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