Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[]
steps	0
major rules	0
active labels