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