Scales of minimal complexity in K(R)
From MaRDI portal
Publication:412055
DOI10.1007/S00153-012-0267-XzbMATH Open1308.03051OpenAlexW1990409287MaRDI QIDQ412055FDOQ412055
Authors: Daniel W. Cunningham
Publication date: 3 May 2012
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-012-0267-x
Recommendations
- Is there a set of reals not in \(K(\mathbb{R})\)?
- The fine structure of real mice
- The real core model and its scales
- Scales in \({\mathbf K}(\mathbb R)\)
- HODL(ℝ) is a Core Model Below Θ
- Strong partition cardinals and determinacy in \(K(\mathbb R)\)
- Mouse sets
- A diamond principle consistent with AD
- The equivalence of partition properties and determinacy
- A diamond-plus principle consistent with AD
Descriptive set theory (03E15) Inner models, including constructibility, ordinal definability, and core models (03E45) Determinacy principles (03E60)
Cites Work
- The fine structure of the constructible hierarchy
- Descriptive set theory
- Title not available (Why is that?)
- Is there a set of reals not in \(K(\mathbb{R})\)?
- The real core model and its scales
- Title not available (Why is that?)
- The core model
- Title not available (Why is that?)
- The fine structure of real mice
Cited In (3)
This page was built for publication: Scales of minimal complexity in \({K(\mathbb{R})}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412055)