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