Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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