Exercise logic.propositional.cnf.unicode
Description
Proposition to CNF (unicode support)
Derivation
Final term is not finished
(T ∧ ¬(((T ∧ r) ∨ r) ↔ r)) ∨ ¬T ∨ ¬r
⇒ logic.propositional.absorpor(T ∧ ¬(r ↔ r)) ∨ ¬T ∨ ¬r
⇒ logic.propositional.defequiv(T ∧ ¬((r ∧ r) ∨ (¬r ∧ ¬r))) ∨ ¬T ∨ ¬r
⇒ logic.propositional.idempand(T ∧ ¬(r ∨ (¬r ∧ ¬r))) ∨ ¬T ∨ ¬r
⇒ logic.propositional.idempand(T ∧ ¬(r ∨ ¬r)) ∨ ¬T ∨ ¬r
⇒ logic.propositional.complor(T ∧ ¬T) ∨ ¬T ∨ ¬r
⇒ logic.propositional.complandF ∨ ¬T ∨ ¬r