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