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