Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.defequiv

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