Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
¬(q → p) ↔ ((r ∧ s) ∨ (¬r ∧ ¬s) ∨ ¬s)
ready: no
Feedback
Path 1
path | [0, 1, 0, 5, 5, 4, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 3, 3] |
steps | 18 |
major rules | 3 |
active labels | |
enter dnf,
check,
enter simplify,
navigator.down,
navigator.down,
logic.propositional.notnot,
navigator.up,
navigator.up,
exit simplify,
check,
enter simplify,
enter andrules,
logic.propositional.truezeroand,
exit andrules,
exit simplify,
check,
enter eliminateimplequiv,
logic.propositional.defequiv