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