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