Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

Feedback

Path 1

path[]
steps0
major rules0
active labels