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