Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.absorpor

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

⇒ logic.propositional.absorpor

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

⇒ logic.propositional.truezeroand

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