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) ∧ T
⇒ logic.propositional.truezeroand¬(r ∧ (r ↔ r) ∧ T) ∧ ¬(r ∧ (r ↔ r) ∧ T)
⇒ logic.propositional.truezeroand¬(r ∧ (r ↔ r) ∧ T) ∧ ¬(r ∧ (r ↔ r))
⇒ logic.propositional.defequiv¬(r ∧ (r ↔ r) ∧ T) ∧ ¬(r ∧ ((r ∧ r) ∨ (¬r ∧ ¬r)))
⇒ logic.propositional.idempand¬(r ∧ (r ↔ r) ∧ T) ∧ ¬(r ∧ (r ∨ (¬r ∧ ¬r)))
⇒ logic.propositional.absorpand¬(r ∧ (r ↔ r) ∧ T) ∧ ¬r