The set of all theorems, or even all statements, is countably infinite. The symbolic representation of a statement is only a string of characters and can be con

The set of all theorems, or even all statements, is countably infinite. The symbolic representation of a statement is only a string of characters and can be converted to a very large integer. Even our notion of uncountable sets is itself countable, in that we use language to reason about them. It actually pretty sad - we’re are two-dimensional creatures in the three-dimensional world.