Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.defequiv

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