Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.nottrue

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.absorpand

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

⇒ logic.propositional.idempand

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