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