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