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