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