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