Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

(¬((q ∨ q) → p) ∧ (((r ↔ (s ∨ s)) ∧ T) ∨ ¬(s ∧ s))) ∨ (¬¬(q → p) ∧ ¬((r ↔ (s ∨ s)) ∨ ¬(s ∧ s)))

ready: no

Feedback

• onefirst
• allfirsts (2)
• allapplications
• derivation
• microsteps

Path 1

path	[]
steps	0
major rules	0
active labels