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