Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.falsezeroor

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