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