Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.falsezeroor

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