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