Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.falsezeroand

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

⇒ logic.propositional.falsezeroor

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