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