Index
Exercises
Services
Exercise
information
strategy
rules
examples
derivations
test report
Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
F ∨ ((F ∨ ¬((T ∧ q) → p)) ↔ (((r ↔ s) ∨ ¬(s ∨ s)) ∧ T))
ready: no
Feedback
onefirst
allfirsts (5)
allapplications
derivation
microsteps
Path 1
path
[]
steps
0
major rules
0
active labels