Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.defequiv

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