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