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