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