Gödel's theorems are about uncountable infinities of statements, and statements whose meaning proof is outside the bounds of a theory. Nothing contradicts the p

Gödel's theorems are about uncountable infinities of statements, and statements whose meaning proof is outside the bounds of a theory. Nothing contradicts the possibility of an algorithm as good as as any human doing formal math.