Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[]
steps	0
major rules	0
active labels