Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

Feedback

Path 1

path[]
steps0
major rules0
active labels