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