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