Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.nottrue

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