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