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