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