Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.truezeroand

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