Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[]
steps	0
major rules	0
active labels