Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.notnot

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