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