Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[]
steps	0
major rules	0
active labels