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