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