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