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