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