Mouse sets

DOI10.1016/S0168-0072(97)89645-5zbMATH Open0952.03058arXivmath/9606207OpenAlexW4213188699MaRDI QIDQ1364547FDOQ1364547

Mitch Rudominer

Publication date: 11 January 2001

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Abstract: In this paper we explore a connection between descriptive set theory and inner model theory. From descriptive set theory, we will take a countable, definable set of reals, A. We will then show that A is equal to the reals of M, where M is a canonical model from inner model theory. In technical terms, M is a mouse. Consequently, we say that A is a mouse set. For a concrete example of the type of set A we are working with, let OD(n) be the set of reals which are Sigma-n definable over the omega-first level of the model L(R), from an ordinal parameter. In this paper we will show that for all n, OD(n) is a mouse set. Our work extends some similar results due to D.A. Martin, J.R. Steel, and H. Woodin. Several interesting questions in this area remain open.

Full work available at URL: https://arxiv.org/abs/math/9606207

Recommendations

• The largest countable inductive set is a mouse set
• Descriptive inner model theory
• The mouse set conjecture for sets of reals

zbMATH Keywords

large cardinalsdescriptive set theoryinner model theorydefinable set of realsmouse set

Mathematics Subject Classification ID

Descriptive set theory (03E15) Large cardinals (03E55) Inner models, including constructibility, ordinal definability, and core models (03E45)

Cites Work

• Descriptive set theory
• Inner models with many Woodin cardinals
• Iteration Trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Projectively well-ordered inner models
• Measure and category in effective descriptive set theory
• Core models with more Woodin cardinals
• The Theory of Countable Analytical Sets
• Supercompact cardinals, sets of reals, and weakly homogeneous trees
• Cabal Seminar 79-81. Proceedings, Caltech-UCLA Logic Seminar 1979-81
• Countable ordinals and the analytical hierarchy
• Title not available (Why is that?)
• The largest countable inductive set is a mouse set

Cited In (3)

• Scales of minimal complexity in \({K(\mathbb{R})}\)
• An undecidable extension of Morley's theorem on the number of countable models
• Inner model operators in \(L(\mathbb{R})\)

This page was built for publication: Mouse sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364547)