Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.demorganor

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

⇒ logic.propositional.notnot

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