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