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