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