Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
((¬((q ∨ q) → p) ∧ T) ↔ ((r ↔ (F ∨ s)) ∨ ¬s)) ∨ ((¬((q ∨ q) → p) ∧ T) ↔ ((r ↔ (F ∨ s)) ∨ ¬s))
ready: noFeedback
Path 1
path | [] |
steps | 0 |
major rules | 0 |
active labels |