Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

¬(¬¬(T ∨ F) ∧ r ∧ (r ↔ r))

⇒ logic.propositional.notnot

¬((T ∨ F) ∧ r ∧ (r ↔ r))

⇒ logic.propositional.falsezeroor

¬(T ∧ r ∧ (r ↔ r))