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