Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.demorganor

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

⇒ logic.propositional.notnot

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