Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

¬(q → p) ↔ (((r ↔ (s ∨ F)) ∧ (r ↔ (T ∧ (s ∨ F)))) ∨ ¬s)

⇒ logic.propositional.truezeroand

¬(q → p) ↔ (((r ↔ (s ∨ F)) ∧ (r ↔ (s ∨ F))) ∨ ¬s)

⇒ logic.propositional.falsezeroor

¬(q → p) ↔ (((r ↔ (s ∨ F)) ∧ (r ↔ s)) ∨ ¬s)