Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.defequiv

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