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