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