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