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