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