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