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