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