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