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