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