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