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