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