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