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