Using a result of recursive function theory and results of the complex analysis of Takeuti which is based on a type theory and the work of Kreisel, and which gives a conservative extension of first order Peano arithmetic (PA), it is shown that the Riemann hypothesis is decidable in PA.