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