Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.falsezeroor

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