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