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