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