Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.idempor

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

⇒ logic.propositional.demorganor

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

⇒ logic.propositional.notnot

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