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