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