Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.absorpor

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

⇒ logic.propositional.falsezeroor

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