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