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