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