Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
![](http://ideas.cs.uu.nl/images/external.png)
((T ∧ ¬(q → p)) ↔ ((r ↔ s) ∨ ¬s)) ∨ (¬(q → p) ∧ ((r ↔ s) ∨ ¬s)) ∨ (¬(T ∧ ¬(q → p)) ∧ ¬((r ↔ s) ∨ ¬s))
ready: noFeedback
Path 1
path | [0, 2, 0, 0, 0, 1, 1] |
steps | 7 |
major rules | 1 |
active labels |
|