The result in the Medium article applies only to a theory whose theorems are computationally enumerable. In computer science, we need theories that axiomatize s

The result in the Medium article applies only to a theory whose theorems are computationally enumerable. In computer science, we need theories that axiomatize subject matter such as natural numbers and computation up to a unique isomorphism so that the objects being axiomatized are characterized precisely. Such theories have induction axioms with uncountable instances. Consequently, the theories have uncountable axiom instances and their theorems cannot possibly be computationally enumerated although each proof can be computationally checked for correctness. Therefore, a more general proof is needed to prove incompleteness. Such a proof can be found here: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3459566 https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3459566