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