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