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