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