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