Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.defimpl

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