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