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