Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.complor

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

⇒ logic.propositional.compland

F ∨ ¬T ∨ F ∨ ¬r