Archive for the ‘Undecidability and incompleteness’ Category

Goodstein sequences

July 27, 2007

Will Sladek, a student at Caltech, wrote an excellent introductory paper on incompleteness in PA, The termite and the tower. While Will was working on his paper, I wrote a short note, Goodstein’s function, on how to compute Goodstein’s function. Please let me know of any comments of corrections to either article.

117b – Some additional remarks on provably recursive functions

February 28, 2007

There are quite a few examples of natural combinatorial statements not provable in \mbox{\sf PA} other than the ones discussed in lecture. The references listed below present several of them and provide a guide to the existent literature; I especially recommend the beautiful expository paper by Stephen Simpson and in general the whole collection where that paper appeared. I will ask you to abstain from looking at the Kanamori-McAloon paper for the time being, since its main result is the content of the last homework set.

There are at least two `combinatorial’ methods for showing that a function is not provably recursive. One is to use indicators, this technique, due to Paris, requires a bit of model theory, and is the method of the proof you are asked to provide in the homework.

The other method comes from a careful analysis of which functions are provably total in \mbox{\sf PA}. For this, one defines a fast-growing hierarchy of recursive functions. This requires some understanding of the concept of an ordinal. The fast-growing (or Grzegorczyk) hierarchy is defined as follows:

  • F_0(n)=n+1.
  • F_{\alpha+1}(n)=F_\alpha^n(n), where the superindex means iterated n times.
  • F_\lambda(n)=F_{\lambda(n)}(n), if \lambda is limit.

Here, \{\lambda(n): n =0,1,\dots\} is some (natural) sequence converging to \lambda (if you are not aware of ordinals, ignore for the moment what the last clause means).

For example, F_1(n)=2n, F_2(n)=2^n n, F_3(n) grows like a stack of n powers of 2 and F_4(n) grows like an iterated stack of powers of 2, there being n such iterations. It is easy to see that each F_n is primitive recursive and strictly increasing, that n<m implies that F_n is eventually dominated by F_m (i.e., that F_n(k)<F_m(k) for all but finitely many values of k), and that every primitive recursive function is eventually dominated by some F_n. Thus, if a function eventually dominates each F_n, it cannot be primitive recursive.

The ordinals provide us with a method for continuing this sequence while preserving that its members are (eventually) increasing and the sequence itself is increasing under eventual domination. Say that a linearly ordered set X is well-ordered if it has no infinite descending chains. For our purposes, the ordinals are simply a way to talk about well-ordered sets (classically, ordinals denoted the order types of the well-ordered sets, i.e., the equivalence classes of these sets under the relation of being order-isomorphic. The modern viewpoint is different and we don’t need it here). We use n to denote the order type of any linearly ordered set of n elements, and use \omega to represent the order type of the natural numbers. We `add’ two order types \alpha and \beta by forming the disjoint union of a set of order type \alpha followed by a set of order type \beta. We also say that \alpha is smaller than \beta if any set of order type \beta has a (proper) initial segment of order type \alpha. We can then continue the sequence 0,1,2,\dots of the natural numbers, as follows: 

\omega,\omega+1,\omega+2,\dots,\omega 2,\omega 2+1,\dots,\omega 3,\dots,\omega^2,\dots,\omega^3,\dots

where we use \omega2 to represent \omega+\omega, etc, \omega^2 to represent \omega\omega and so on, and we can continue even beyond:

\omega^\omega,\dots,\omega^{\omega^\omega},\dots

Call \epsilon_0 (epsilon-0) the first ordinal \alpha obtained this way such that

\alpha=\omega^\alpha (so \epsilon_0=\omega^{\omega^{\omega^{...}}}).

One can show that any ordinal below \epsilon_0 admits a unique `pure base \omega‘ representation, from which there is a natural way of defining the sequence \{\lambda(n):n=0,1,\dots\} converging to \lambda whenever \lambda is a limit, which means that it is not of the form \alpha+1 for any \alpha. For example,

\omega,\omega 3,\omega^{\omega^2 3+\omega 17+8} 5+\omega^3 2, etc,

are all limits. So, for example, the sequence \{\lambda(n): n =0,1,\dots\} corresponding to \lambda=\omega is just \lambda(n)=n and the corresponding function F_\omega is easily seen to grow as the (diagonal) Ackermann function A(n,n); the sequence corresponding to \lambda=\omega^3 4 is \lambda(n)=\omega^3 3+\omega^2 n, etc. As before, each F_\alpha is (eventually) strictly increasing and if \alpha<\beta then F_\beta eventually dominates F_\alpha. Each F_\alpha, for \alpha<\epsilon_0 (and in fact, for many more \alpha) is recursive.

The relation of this sequence with \mbox{\sf PA} lies in that any function provably recursive in \mbox{\sf PA} is eventually dominated by one of the F_\alpha with \alpha<\epsilon_0. So, one purely combinatorial way of showing that a function is not provably recursive is to show that it eventually dominates each such F_\alpha. This kind of analysis was developed by Solovay and Ketonen.

There are also other ways of relating \mbox{\sf PA} to this number \epsilon_0, and proof theorists have a lot more to say about this relation.

Additional references:

  • Lecture notes on enormous integers, by H. Friedman. (2001)
  • Unprovable theorems,  by H. Friedman. (2005) See www.math.ohio-state.edu/~friedman/manuscripts.html for additional manuscripts and details.
  • Unprovable theorems and fast-growing functions, by S. Simpson. In Logic and combinatorics, S. Simpson, ed. AMS (1987).
  • On Gödel incompleteness and finite combinatorics, by A. Kanamori and K. McAloon. Annals of Pure and Applied Logic 33 (1987), 23-41.

117b – Undecidability and incompleteness – Lecture 11

February 27, 2007

Let T\vdash Q be r.e. and suppose there is a sentence \varphi such that T does not prove \varphi. Then T+\varphi is more powerful than T in two ways:  

  1. It proves more theorems than T; for example,  \varphi.
  2. It provides much shorter proofs of theorems of T; for example: For any (total) recursive function f there is a sentence \theta provable in T but such that in T+\varphi there is a proof p of \theta such that no proof of \theta in T is shorter than f(p).

This leads to considering those recursive functions f of which T can prove that they are total. One calls such functions provably recursive in T. It is easy to show that for any \Sigma^0_1-sound T\vdash\mbox{\sf PA}, there are recursive functions that are not provably recursive in T. The statement that f is total,

\forall x\exists y\,f(x)=y,

is easily seen to be \Pi^0_2 and for T=\mbox{\sf PA} one can provide natural examples of such recursive but not provably recursive functions f, thus providing natural (combinatorial) examples of independent \Pi^0_2-sentences. Actually, this can also be done for much stronger systems than \mbox{\sf PA}, like \mbox{\sf ZFC}, and Harvey Friedman has provided several such examples.

For \mbox{\sf PA}, the most famous examples are perhaps the following:

  • Goodstein (1944). The pure base-n representation of a number m is obtained by writting m in base n, writing the exponents of this representation also in base n, writing the exponents of these representations in base n, and so on. For n\ge2 let G_n(0)=0 and for m\ge1 let G_n(m) be the result of writing the pure base-n representation of m, replacing each n by n+1, and subtracting 1. The Goodstein sequence of m is the sequence m, G_2(m), G_3(G_2(m)), G_4(G_3(G_2(m))),\dots This sequence eventually converges to 0. The function F that to m assigns the number of steps necessary for this to occur is recursive but not provably recursive in \mbox{\sf PA}. In fact, given any f provably recursive in \mbox{\sf PA}, F eventually dominates f.
  • Kirby, Paris (1982). Define a hydra to be a finite rooted tree. A head of the hydra is any node (other than the head) with only one edge connected to it, together with this edge. Hercules fights the hydra by chopping off its heads one by one by stages. At stage n, the hydra grows new heads as follows: from the node that used to be attached to the head just removed, traverse one edge towards the root and from this node just reached, sprout n copies of the part of the hydra above the edge just traversed. For any hydra, no matter how Hercules battles it, he eventually wins (i.e., the hydra is reduced to a single node). Moreover, given a hydra there is an absolute bound M on the number of stages that it takes Hercules to win. Coding (in any reasonable fashion) hydras by numbers, the function that assigns this number M=F(n) to a given hydra n is recursive but eventually dominates all functions provably recursive in \mbox{\sf PA}.
  • Paris, Harrington (1977). Given a set A, let A^{[n]} denote the collection of its subsets of size n. Given a function f:A^{[n]}\to B, say that a subset C of A is homogeneous for f iff f restricted to C^{[n]} is constant, and say that it is large if |C|\ge\min(C). Ramsey’s theorem, provable in \mbox{\sf PA}, states that for any c,n,b there is an M such that given any A of size M, any B of size b and any f:A^{[n]}\to B, there is a C homogeneous for f and of size at least c. The function that to c,n,b assigns the least such M is well known to be primitive recursive (just about any standard proof of Ramsey theorem in any combinatorics book shows that it roughly grows exponentially). Paris and Harrington showed that if we also require that the homogeneous set C be large, then the new statement is also true but the resulting function (clearly recursive) eventually dominates all functions provably recursive in \mbox{\sf PA}.

117b – Undecidability and incompleteness – Lecture 10

February 22, 2007

A theory T (r.e., extending Q) is reflexive iff it proves the consistency of all its finite subtheories. It is essentially reflexive iff each r.e. extension is reflexive.

Then PA is essentially reflexive and therefore no consistent extension of PA is finitely axiomatizable. This is obtained by showing that, in spite of Tarski’s undefinability of truth theorem, there are (provably in PAS0ntruth predicates for all n.

We define Rosser sentences and show their undecidability. We also show Löb’s theorem that if T|-PA is an r.e. theory and T|-PrT(j)®j, then T|- j. This gives another proof of the second incompleteness theorem.

Finally, we show that the length of proofs of P01-sentences is not bounded by any recursive function: For any T|-Q r.e. and consistent, and any recursive function f, there is a P01-sentence j provable in T but such that any proof of j in T has length > f(j).

117b – Undecidability and incompleteness – Lecture 9

February 20, 2007

Let S and T be r.e. theories in the language of arithmetic. Assume that S is strong enough to binumerate all primitive recursive relations. This suffices to prove the fixed point lemma:

For any formula g(x) there is a sentence j  such that S |- (j g(j)),

moreover, j can be chosen of the same complexity as g.

The (Löb) Derivability conditions  for S,T are the following three statements:

  • For any j, if T|-j, then S|- PrT(j).
  • S|- For any j, y ( PrT(j®y) Ù PrT(j)  ®  PrT(y) ). 
  • S|-For any j ( PrT(j)®PrT(PrT(j)) ).

For example, S=Q suffices for the proof of the fixed point lemma and of the first derivability condition and S=PA suffices for the other two.

Gödel incompleteness theorems:

  1. Let S be r.e. and strong enough to satisfy the fixed point lemma and the first derivability condition. Let T |- S be r.e. and consistent. Then there is a true P01 sentence j such that T does not prove j. If T is S01-sound, then T does not prove ¬j either.
  2. If in addition S satisfies the other two derivability conditions, then T does not prove Con(T), the statement asserting the consistency of T.

As a corollary, Q is essentially undecidable: Not only it is undecidable, but any r.e. extension is undecidable as well. Gödel’s original statement replaced S01-soundness with the stronger assumption of wconsistency.

117b – Undecidability and incompleteness – Lecture 8

February 15, 2007

We introduce Robinson’s arithmetic Q. It is a weak (and sound) theory that proves all true S01 sentences. We also introduce Peano Arithmetic PA. PA is sound and designed to “capture” all true first order statements about N. (The incompleteness theorems will show that it does not suceed: There are true statements that PA does not prove.)

We show that Q represents all c.e. sets and binumerates all recursive sets, in particular all primitive recursive functions.  PA actually proves that the representations of primitive recursive functions define functions, so in any (maybe non-standard) model of PA it makes sense to talk, for example, of the exponential function, or the function enumerating the primes.

We prove the fixed point lemma and deduce from it Tarski’s theorem on the undefinability of truth, thus formally solving the liar’s paradox.

117b – Undecidability and incompleteness – Lecture 7

February 13, 2007

We define essentially undecidable theories as those theories (of arithmetic) that are recursively axiomatizable but such that any recursive extension T is undecidable and therefore incomplete. We show that if S is essentially undecidable then there are continuum many complete extensions of S, none of which are c.e. The argument gives an example of a complete binary tree recursive in 0¢ with no c.e. branches.

We show that if j is S00 then its characteristic function is primitive recursive and that if R is a c.e. relation, then it is the range of a primitive recursive function. We use this to prove Craig’s trick showing that a theory admits a c.e. axiomatization iff it admits a primitive recursive axiomatization.

We define (numeralwise) representability and binumerability of a relation by a formula in a given theory. Next lecture we will show that there is an essentially undecidable finitely axiomatizable theory that represents all c.e. relations and binumerates all recursive relations. This will be the key to the proof of the incompleteness theorems.

117b – Undecidability and incompleteness – Lecture 6

February 8, 2007

We briefly discuss the problem of generalizing the proof of unsolvability of Hilbert’s tenth problem to other (recursive) rings.

We prove a version of the first incompleteness theorem as a consequence of the unsolvability of the tenth problem: If S is any recursive set of axioms strong enough to prove a very weak fragment of arithmetic (the addition and multiplication tables for N suffice) then either S is not true of N, or else S is incomplete. The reason is that if S is true of N, then the set of consequences of S is an undecidable r.e. set (by the unsolvability of the tenth problem), but the set of consequences of a complete theory is decidable.

Additional references:

  • The incompleteness theorems,  by C. Smorynski. In Handbook of mathematical logic, J. Barwise, ed., North-Holland (1977), 821-865.
  • Models of Peano Arithmetic, by R. Kaye. Claredon Press (1991).
  • Aspects of incompleteness, by P. Lindström. Springer (1997).
  • On formally undecidable sentences of Principia Mathematica and related systems (German: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. I.), by K. Gödel. Monatshefte für Mathematik und Physik  38 (1931), 173-198. Reprinted in several places. See for example Collected Works, vol. I, K. Gödel. Oxford University Press (2001).

117b – Undecidability and incompleteness – Lecture 5

February 8, 2007

We complete the proof of the undecidability of Hilbert’s tenth problem, and discuss some of its consequences, tying up with the general theory of the degrees and leading directly into the second part of this topic: The incompleteness theorems.

117b – Undecidability and Incompleteness – Lecture 4

February 1, 2007

We show that a=n! is Diophantine. This implies that the prime numbers are Diophantine. Therefore, there is a polynomial in several variables with integer coefficients whose range, when intersected with the natural numbers, coincides with the set of primes. Amusingly, no nonconstant polynomial with integer coefficients can only take prime values.

We prove the bounded quantifier lemma, the last technical component of the proof. It implies that the class of relations definable by a S01 formula in the structure (N,+,´,<) coincides with the class of S1 relations (i.e., the Diophantine ones).

To complete the proof of the undecidability of the tenth problem, we will show that any c.e. relation is Diophantine. For this, we recall that a set is c.e. iff it is the domain of a Turing machine and proceed to code the behavior of Turing machines by means of a Diophantic representation. This involves coding configurations of Turing machines and it remains to show how to code the way a configuration changes into another one.