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