Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defequiv

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