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