Exercise logic.propositional.cnf.unicode
Description
Proposition to CNF (unicode support)
Derivation
Final term is not finished
¬((r ∨ r) ↔ r) ∨ (T ∧ (¬T ∨ ¬r))
⇒ logic.propositional.nottrue¬((r ∨ r) ↔ r) ∨ (T ∧ (F ∨ ¬r))
⇒ logic.propositional.falsezeroor¬((r ∨ r) ↔ r) ∨ (T ∧ ¬r)
⇒ logic.propositional.truezeroand¬((r ∨ r) ↔ r) ∨ ¬r