Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.absorpor

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