Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.absorpor

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

⇒ logic.propositional.falsezeroor

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