Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[]
steps	0
major rules	0
active labels