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