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