Exercise logic.propositional.cnf.unicode
Description
Proposition to CNF (unicode support)
Derivation
![](http://ideas.cs.uu.nl/images/external.png)
¬((r ↔ r) ∧ ((r ∧ (r ↔ r) ∧ T) ∨ ((r ↔ r) ∧ T ∧ r)))
⇒ logic.propositional.defequiv¬((r ↔ r) ∧ ((r ∧ ((r ∧ r) ∨ (¬r ∧ ¬r)) ∧ T) ∨ ((r ↔ r) ∧ T ∧ r)))
⇒ logic.propositional.idempand¬((r ↔ r) ∧ ((r ∧ (r ∨ (¬r ∧ ¬r)) ∧ T) ∨ ((r ↔ r) ∧ T ∧ r)))
⇒ logic.propositional.absorpand¬((r ↔ r) ∧ ((r ∧ T) ∨ ((r ↔ r) ∧ T ∧ r)))
⇒ logic.propositional.truezeroand¬((r ↔ r) ∧ (r ∨ ((r ↔ r) ∧ T ∧ r)))