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