Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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