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