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