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