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