Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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