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