Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.complor

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

⇒ logic.propositional.notfalse

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

⇒ logic.propositional.compland

F ∨ ¬(T ∧ r)