Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroand

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