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