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