The Decidability of the Riemann Hypothesis
Number Theory
2024-12-04 v3
Abstract
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.
Keywords
Cite
@article{arxiv.2312.11565,
title = {The Decidability of the Riemann Hypothesis},
author = {Kevin Broughan},
journal= {arXiv preprint arXiv:2312.11565},
year = {2024}
}
Comments
Comment: have added information in the introduction on what is meant by "decidability", indicating that it is comparable to that used in the famous DPRM negative solution to Hilbert's 10th problem. References for that theorem have been added