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