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