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