Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.nottrue

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.truezeroand

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