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