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