Incompleteness for stably computable formal systems
share
We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of Gödel. A typical stably computably enumerable set is the set of Diophantine equations with no integer solutions, and in particular such sets are generally not computably enumerable. And so this gives the first extension of the second incompleteness theorem to non classically computable formal systems. Let's motivate this with a somewhat physical application. Let ℋ be the suitable infinite time limit (stabilization in the sense of the paper) of the mathematical output of humanity, specializing to first order sentences in the language of arithmetic (for simplicity), and understood as a formal system. Suppose that all the relevant physical processes in the formation of ℋ are Turing computable. Then as defined ℋ may not be computably enumerable, but it is stably computably enumerable. Thus, the classical Gödel disjunction applied to ℋ is meaningless, but applying our incompleteness theorems to ℋ we then get a sharper version of Gödel's disjunction: assume ℋ⊢ PA then either ℋ is not stably computably enumerable or ℋ is not 1-consistent (in particular is not sound) or ℋ cannot prove a certain true statement of arithmetic (and cannot disprove it if in addition ℋ is 2-consistent).
READ FULL TEXT
