[FOM] Clay Institute millennium prize problems

[Joe Shipman]

Of the seven original prize problems, two (P-NP, Birch-Swinnerton-Dyer) were arithmetical, and two (Poincare, Riemann) were known to be equivalent to arithmetical questions.

Of the other three (Hodge, Navier-Stokes, Yang-Mills), which are known to be equivalent to questions from whose syntactic form one may know that the axiom of choice would be eliminable from any proof of them?

— JS

Sent from my iPhone