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