The Decidability of the Riemann Hypothesis

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), assuming all critical zeros of the Riemann zeta function are simple, we show that RH is decidable in PA.