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