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