Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[]
steps	0
major rules	0
active labels