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