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