Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

¬((q → p) ∨ (q → p)) ↔ ((r ↔ s) ∨ ¬¬(¬s ∨ F))

⇒ logic.propositional.notnot

¬((q → p) ∨ (q → p)) ↔ ((r ↔ s) ∨ ¬s ∨ F)

⇒ logic.propositional.falsezeroor

¬((q → p) ∨ (q → p)) ↔ ((r ↔ s) ∨ ¬s)