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