theHigherGeometer on Nostr: If this holds up, it's a result that's been open for a very long time. The author [1] ...
If this holds up, it's a result that's been open for a very long time. The author [1] is no slouch, having published a three-volume work on equivalents to RH, and a book surveying the state of the art on bounded gaps between primes. But I can't evaluate this paper.
Kevin Broughan, "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), we show that RH is decidable in PA.
https://arxiv.org/abs/2312.11565
[1] https://www.math.waikato.ac.nz/~kab/
Kevin Broughan, "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), we show that RH is decidable in PA.
https://arxiv.org/abs/2312.11565
[1] https://www.math.waikato.ac.nz/~kab/