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