Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished
¬(q → p) ↔ (¬s ∨ (((r ∧ s) ∨ (¬¬¬r ∧ ¬s)) ∧ T))
⇒ logic.propositional.truezeroand¬(q → p) ↔ (¬s ∨ (r ∧ s) ∨ (¬¬¬r ∧ ¬s))
⇒ logic.propositional.notnot¬(q → p) ↔ (¬s ∨ (r ∧ s) ∨ (¬r ∧ ¬s))