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