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