Switch to: References

Add citations

You must login to add citations.
  1. Sets and singletons.Kai Hauser & W. Hugh Woodin - 1999 - Journal of Symbolic Logic 64 (2):590-616.
    We extend work of H. Friedman, L. Harrington and P. Welch to the third level of the projective hierarchy. Our main theorems say that (under appropriate background assumptions) the possibility to select definable elements of non-empty sets of reals at the third level of the projective hierarchy is equivalent to the disjunction of determinacy of games at the second level of the projective hierarchy and the existence of a core model (corresponding to this fragment of determinacy) which must then contain (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The Consistency Strength of $$\aleph{\omega}$$ and $$\aleph_{{\omega}1}$$ Being Rowbottom Cardinals Without the Axiom of Choice.Arthur W. Apter & Peter Koepke - 2006 - Archive for Mathematical Logic 45 (6):721-737.
    We show that for all natural numbers n, the theory “ZF + DC $_{\aleph_n}$ + $\aleph_{\omega}$ is a Rowbottom cardinal carrying a Rowbottom filter” has the same consistency strength as the theory “ZFC + There exists a measurable cardinal”. In addition, we show that the theory “ZF + $\aleph_{\omega_1}$ is an ω 2-Rowbottom cardinal carrying an ω 2-Rowbottom filter and ω 1 is regular” has the same consistency strength as the theory “ZFC + There exist ω 1 measurable cardinals”. We (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Scales of minimal complexity in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${K(\mathbb{R})}$$\end{document}. [REVIEW]Daniel W. Cunningham - 2012 - Archive for Mathematical Logic 51 (3-4):319-351.
    Using a Levy hierarchy and a fine structure theory for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${K(\mathbb{R})}$$\end{document}, we obtain scales of minimal complexity in this inner model. Each such scale is obtained assuming the determinacy of only those sets of reals whose complexity is strictly below that of the scale constructed.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A covering lemma for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${K(\mathbb {R})}$$\end{document}. [REVIEW]Daniel W. Cunningham - 2007 - Archive for Mathematical Logic 46 (3-4):197-221.
    The Dodd–Jensen Covering Lemma states that “if there is no inner model with a measurable cardinal, then for any uncountable set of ordinals X, there is a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${Y\in K}$$\end{document} such that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${X\subseteq Y}$$\end{document} and |X| = |Y|”. Assuming ZF+AD alone, we establish the following analog: If there is no inner model with an \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The consistency strength of choiceless failures of SCH.Arthur W. Apter & Peter Koepke - 2010 - Journal of Symbolic Logic 75 (3):1066-1080.
    We determine exact consistency strengths for various failures of the Singular Cardinals Hypothesis (SCH) in the setting of the Zermelo-Fraenkel axiom system ZF without the Axiom of Choice (AC). By the new notion of parallel Prikry forcing that we introduce, we obtain surjective failures of SCH using only one measurable cardinal, including a surjective failure of Shelah's pcf theorem about the size of the power set of $\aleph _{\omega}$ . Using symmetric collapses to $\aleph _{\omega}$ , $\aleph _{\omega _{1}}$ , (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Making all cardinals almost Ramsey.Arthur W. Apter & Peter Koepke - 2008 - Archive for Mathematical Logic 47 (7-8):769-783.
    We examine combinatorial aspects and consistency strength properties of almost Ramsey cardinals. Without the Axiom of Choice, successor cardinals may be almost Ramsey. From fairly mild supercompactness assumptions, we construct a model of ZF + ${\neg {\rm AC}_\omega}$ in which every infinite cardinal is almost Ramsey. Core model arguments show that strong assumptions are necessary. Without successors of singular cardinals, we can weaken this to an equiconsistency of the following theories: “ZFC + There is a proper class of regular almost (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • The comparison lemma.John R. Steel - forthcoming - Annals of Pure and Applied Logic.
    Download  
     
    Export citation  
     
    Bookmark