Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[]
steps	0
major rules	0
active labels