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