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