Earlier quoted context omitted.
There is no objective mathematical reality, because it cannot include a statements about its own consistency I'm assuming we're talking about Gödel's incompleteness theorems? Don't they just say that if there's such a thing as objective mathematical reality, it can't be effectively axiomatized?
> Don't they just say that if there's such a thing as objective mathematical reality, it can't be effectively axiomatized? No they don't. Real space doesn't appear to be infinite, and Zn is not subject to Godel's incompleteness theorem. If you drop the requirement of infinite numbers and "recursive" infinites (e.g. real numbers), as reality appears to do, there is no problem.
While you no longer have undecidability (and therefore no incompleteness, either), you do have its finite form, namely infeasibility (due to computational complexity), which, given an assumption that time is finite, amounts to precisely the same result. Almost every theorem about undecidability can be generalized to infeasibility. For example, instead of undecidability of the halting problem, we get infeasibility of the bounded halting problem (that's the basis for the hierarchy theorems, which gave birth to the notion of computational complexity, just as the halting problem gave birth to the notion of computability). Similarly, by bounded halting, instead of a consequence of incompleteness, i.e. "there are statements that can neither be proven nor falsified", you get "there are statements that can be neither feasibly proven nor falsified" -- this is a direct corollary of the hierarchy theorems -- and the problem remains the same. The only question is whether you're willing to admit infinity (or what kinds of infinity you're willing to admit) as a convenience, or as an approximation of large finite quantities. But choosing not to admit infinity doesn't really make anything simpler (on the contrary, things may get more tedious).