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