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