Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[]
steps	0
major rules	0
active labels