Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.idempor

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