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