Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.absorpor

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

⇒ logic.propositional.absorpand

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

⇒ logic.propositional.falsezeroor

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