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