Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

¬((((r ∨ F) ↔ r) ∧ T ∧ r) ∨ (T ∧ r ∧ (r ↔ r)))

⇒ logic.propositional.defequiv

¬((((r ∨ F) ↔ r) ∧ T ∧ r) ∨ (T ∧ r ∧ ((r ∧ r) ∨ (¬r ∧ ¬r))))

⇒ logic.propositional.idempand

¬((((r ∨ F) ↔ r) ∧ T ∧ r) ∨ (T ∧ r ∧ (r ∨ (¬r ∧ ¬r))))

⇒ logic.propositional.absorpand

¬((((r ∨ F) ↔ r) ∧ T ∧ r) ∨ (T ∧ r))

⇒ logic.propositional.truezeroand

¬((((r ∨ F) ↔ r) ∧ T ∧ r) ∨ r)