Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

¬((¬q ∨ T) ∧ (¬q ∨ p)) ↔ ((T ∧ (r ↔ s)) ∨ ¬s)

⇒ logic.propositional.truezeroor

¬(T ∧ (¬q ∨ p)) ↔ ((T ∧ (r ↔ s)) ∨ ¬s)

⇒ logic.propositional.truezeroand

¬(¬q ∨ p) ↔ ((T ∧ (r ↔ s)) ∨ ¬s)