Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.notfalse

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

⇒ logic.propositional.truezeroand

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