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