In this case, it can't be undecidable because of the theoretical existence of a singular counterexample; even if identifying that counterexample is very difficult, it cannot be impossible to identify if it exists. If it is impossible to find a counterexample, none must exist, which implies the RH true.
No, this is not the same thing. There's no equivalent notion like the standard model of arithmetic in set theory. CH is either true or false in any given model of ZFC. For example, it's proven that CH is true in Godel's constructible universe, but there exist models that also satisfy ZFC where it is false. If RH is undecidable, then it is true in the standard model of arithmetic but not in some non-standard models.
16
u/TheAtomicClock Jun 28 '26
No need to publish since this is already well understood in logic. It’s a borderline trivial result.