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