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