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