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