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