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