Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempor

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defimpl

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