2013/01/21 by Grigor Sargsyan, Sargsyan, Grigor
Computer Science · Mathematics · #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Mathematical Dynamics and Fractals #math.LO
paper · pdf · doi:10.48550/arxiv.1301.4925
arxiv created 2013/01/21 · openalex publication_date 2013/01/21 · arxiv updated 2013/01/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Working under AD, we investigate the length of prewellorderings given by the iterates of \M2k+1, which is the minimal proper class mouse with 2k+1 many Woodin cardinals. In particular, we answer some questions from \citeHjorth01 (the discussion of the questions appears in the last section of \citeHjorthD).