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