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