I would like to know if we are sure that the 6 remaining Millenium Prize Problems, like the Riemann hypothesis and the P vs NP problem, have a proof in set theory. They might fall into the undecidable category as far as we know, right?
Thank you for your help.
No we are not sure. So what?
“Problems worthy of attack prove their worth by fighting back.”
― Piet Hein, Grooks 1