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