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