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