Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[]
steps	0
major rules	0
active labels