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