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