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