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