Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished
¬¬((T ∧ ¬(q → p)) ↔ (F ∨ (((r ↔ s) ∨ ¬s) ∧ ((r ↔ s) ∨ ¬s))))
⇒ logic.propositional.falsezeroor¬¬((T ∧ ¬(q → p)) ↔ (((r ↔ s) ∨ ¬s) ∧ ((r ↔ s) ∨ ¬s)))
⇒ logic.propositional.idempand¬¬((T ∧ ¬(q → p)) ↔ ((r ↔ s) ∨ ¬s))
⇒ logic.propositional.defequiv¬¬((T ∧ ¬(q → p)) ↔ ((r ∧ s) ∨ (¬r ∧ ¬s) ∨ ¬s))
⇒ logic.propositional.absorpor¬¬((T ∧ ¬(q → p)) ↔ ((r ∧ s) ∨ ¬s))