Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.truezeroand

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