Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.absorpand

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