Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[0, 0, 0]
steps	3
major rules	1
active labels	dnf orrules