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))) ∧ ((r ↔ s) ∨ F ∨ ¬(T ∧ s))) ∨ (¬¬(q → (p ∨ F)) ∧ ¬((r ↔ s) ∨ ¬s))
ready: no
Feedback
onefirst
allfirsts (1)
allapplications
derivation
microsteps
Path 1
path
[]
steps
0
major rules
0
active labels