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