Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.absorpor

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