Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.falsezeroor

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