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