Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Loosely speaking, there are three kinds of propositions.

  1. Those propositions which are true and can be proved to be true.

  2. Those propositions which are false and which can be proved to be false.

  3. Those propositions which are true, but it can't be proved that it is true.

Here the word "proof" is used in a strict mathematical sense.

My question simply is that under which category does Riemann Hypothesis belong? Or if a bit specification is more preferred, is RH ZFC-independent?

share|improve this question
if you prove something to be provable, then you proved it. –  Ittay Weiss Jun 22 at 7:28
I don't understand how proving that RH is provable is related with the position of the real part of zeros on the critical line. Can you be a bit elaborate? –  William Hilbert Jun 22 at 7:51
I am not sure what this question is asking. Do you mean something along the lines: Is it possible that RH is ZFC-independent? –  Martin Sleziak Jun 22 at 8:08
@MartinSleziak: My question actually is that: Has RH been proved to be formally decidable proposition? If yes, then I want some reference. –  William Hilbert Jun 22 at 12:20
@WilliamHilbert: I'm not aware of any proposition that has been shown decidable without either proof or disproof. As a result it's not surprising to me that RH has not been shown decidable. –  Charles Jun 24 at 13:32

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.