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