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