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