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