Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[]
steps	0
major rules	0
active labels