Complexity of reals in inner models of set theory

DOI10.1016/S0168-0072(98)00010-4zbMath0926.03063arXivmath/9501203MaRDI QIDQ1295378

W. Hugh Woodin, Boban Velickovic

Publication date: 24 June 1999

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

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

zbMATH Keywords

forcinginner modelcoloringsperfect setanalytic setsuperperfect setcomplexity of realsconstructible reals

Mathematics Subject Classification ID

Descriptive set theory (03E15) Consistency and independence results (03E35) Inner models, including constructibility, ordinal definability, and core models (03E45)

Related Items

TREE FORCING AND DEFINABLE MAXIMAL INDEPENDENT SETS IN HYPERGRAPHS ⋮ Proper forcing and rectangular Ramsey theorems ⋮ Cichoń's diagram for uncountable cardinals ⋮ Almost disjoint refinements and mixing reals ⋮ Proper products ⋮ Continuous images of closed sets in generalized Baire spaces ⋮ Σ₁(κ)-DEFINABLE SUBSETS OF H(κ⁺) ⋮ Splitting squares ⋮ The Hurewicz dichotomy for generalized Baire spaces ⋮ CANONICAL BEHAVIOR OF BOREL FUNCTIONS ON SUPERPERFECT RECTANGLES ⋮ Adding a lot of Cohen reals by adding a few. I ⋮ Maharam algebras and Cohen reals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Set theory. An introduction to independence proofs
• Forcing axioms and stationary sets
• Ramsey's theorem with sums or unions
• A basis theorem for \(\sum^ 1_ 3\) sets of reals
• Ramsey and Freeness Properties of Polish Planes
• Forcing the failure of CH by adding a real
• Nonsplitting subset of _κ(κ⁺)
• One hundred and two problems in mathematical logic
• A Basis Theorem for Perfect Sets
• Internal cohen extensions