Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempor

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.demorganor

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

⇒ logic.propositional.notnot

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