arXiv · 2312.11565
The Decidability of the Riemann Hypothesis
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Kevin Broughan. 2023-12-17. The Decidability of the Riemann Hypothesis. https://arxiv.org/abs/2312.11565
Cite the original work for its findings. Save a collection to share your selection of sources.