Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[]
steps	0
major rules	0
active labels