Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[]
steps	0
major rules	0
active labels