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