Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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