Kechris's first conjecture on projective unreachable cardinals
Let denote the supremum of the lengths of pre-well-orderings of . Assume . Kechris's first conjecture. Then is -unreachable. Jackson subsequently proved this conjecture, using his computation of the projective ordinals and the strong partition property of , so the statement is solved.
References
Primary source
Grigor Sargsyan, “Hjorth's reflection argument”, arXiv:2105.06403 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.