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