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