Steel's lightface Levy-hierarchy mouse set conjecture
Steel's lightface Levy-hierarchy mouse set conjecture
Assume . A mouse set is a set for which there is an -iterable premouse with . Let be a level of the lightface Levy hierarchy, and let denote the associated canonical pointset. Steel's conjecture. The set is a mouse set. This asks whether every lightface Levy-hierarchy pointclass has a mouse corresponding exactly to it; the paper reports partial progress, including the case , while the general conjecture remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Derek Levinson, Itay Neeman and Grigor Sargsyan, “Unreachability of Inductive-Like Pointclasses in L(R)”, arXiv:2210.10076 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.