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