Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[]
steps	0
major rules	0
active labels