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