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