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