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