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