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