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