Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

Feedback

Path 1

path[]
steps0
major rules0
active labels