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