Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

Feedback

Path 1

path[]
steps0
major rules0
active labels