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