A countable definable set containing no definable elements
From MaRDI portal
Abstract: We make use of a finite support product of Jensen forcing to define a model in which there is a countable non-empty lightface set of reals containing no ordinal-definable real.
Recommendations
Cites work
- A cofinal family of equivalence relations and Borel ideals generating them
- A Groszek-Laver pair of undistinguishable \(\mathsf{E}_0\)-classes
- A model of set-theory in which every set of reals is Lebesgue measurable
- An effective minimal encoding of uncountable sets
- Borel equivalence relations. Structure and classification
- Counterexamples to countable-section \(\varPi_2^1\) uniformization and \(\varPi_3^1\) separation
- scientific article; zbMATH DE number 3358472 (Why is no real title available?)
- scientific article; zbMATH DE number 3387344 (Why is no real title available?)
- Non-uniformizable sets of second projective level with countable cross-sections in the form of Vitali classes
- On coding uncountable sets by reals
- On the Leibniz–Mycielski axiom in set theory
Cited in
(27)- Countable OD sets of reals belong to the ground model
- Typicality à la Russell in set theory
- Definable elements of definable Borel sets
- Definable \(\mathsf{E}_0\) classes at arbitrary projective levels
- The full basis theorem does not imply analytic wellordering
- Proper and piecewise proper families of reals
- Non-uniformizable sets of second projective level with countable cross-sections in the form of Vitali classes
- Borel OD sets of reals are OD-Borel in some simple models
- scientific article; zbMATH DE number 1923100 (Why is no real title available?)
- Pointwise definable models of set theory
- A definable \(E_0\) class containing no definable elements
- Models of set theory in which the separation theorem fails
- A Groszek-Laver pair of undistinguishable \(\mathsf{E}_0\)-classes
- When does every definable nonempty set have a definable element?
- Definable Hamel bases and ${\sf AC}_\omega ({\mathbb R})$
- An unpublished theorem of Solovay on OD partitions of reals into two non-OD parts, revisited
- A choice function on countable sets, from determinacy
- Reductions between certain incidence problems and the continuum hypothesis
- A model of second-order arithmetic satisfying AC but not DC
- Non-uniformizable sets with countable cross-sections on a given level of the projective hierarchy
- On Russell typicality in set theory
- A good lightface \(\varDelta_n^1\) well-ordering of the reals does not imply the existence of boldface \(\mathbf{\Delta}_{n - 1}^1\) well-orderings
- A classical way forward for the regularity and normalization problems
- Descriptive choice principles and how to separate them
- More on blurry hod
- Independence of the comprehension schema in second-order arithmetic from the parameter-free countable choice
- On the consistency strength of critical leaps
This page was built for publication: A countable definable set containing no definable elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679849)