Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished
(¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(F ∨ (q → p)) ↔ (¬(F ∨ s) ∨ (r ↔ s)))
logic.propositional.falsezeroor
(¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(F ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))