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