von Neumann’s Classification Program is provably impossible
Foreman MatthewNeumann120
on 9/15/23
The axiom V = Ultimate-L is the leading candidate for the maximum possible generalization of Gödel's axiom, V = L. The Ultimate-L Program is the program to show that the axiom V = Ultimate-L s not refuted by large cardinal axioms and even more: that the conception of V itself ultimately requires that V = Ultimate L.
This involves a series of rather specific conjectures, which is the family of Ultimate-L Conjectures.
By recent theorem, if V = Ultimate-L then Goldberg's Ultrapower Axiom holds.
The unexpected feature here is that this can be proved without settling the Ultimate-L Conjectures.