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