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