Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.absorpand

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

⇒ logic.propositional.truezeroand

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