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