Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.absorpand

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