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