Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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