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