Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.complor

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

⇒ logic.propositional.compland

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