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