Switch to: Citations

Add references

You must login to add references.
  1. Thin equivalence relations and inner models.Philipp Schlicht - 2014 - Annals of Pure and Applied Logic 165 (10):1577-1625.
    We describe the inner models with representatives in all equivalence classes of thin equivalence relations in a given projective pointclass of even level assuming projective determinacy. The main result shows that these models are characterized by their correctness and the property that they correctly compute the tree from the appropriate scale. The main step towards this characterization shows that the tree from a scale can be reconstructed in a generic extension of an iterate of a mouse. We then construct models (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Happy families.A. R. D. Mathias - 1977 - Annals of Mathematical Logic 12 (1):59.
    Download  
     
    Export citation  
     
    Bookmark   94 citations  
  • Cichoń’s diagram, regularity properties and $${\varvec{\Delta}^1_3}$$ Δ 3 1 sets of reals.Vera Fischer, Sy David Friedman & Yurii Khomskii - 2014 - Archive for Mathematical Logic 53 (5-6):695-729.
    We study regularity properties related to Cohen, random, Laver, Miller and Sacks forcing, for sets of real numbers on the Δ31\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Delta}^1_3}$$\end{document} level of the projective hieararchy. For Δ21\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Delta}^1_2}$$\end{document} and Σ21\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Sigma}^1_2}$$\end{document} sets, the relationships between these properties follows the pattern of the well-known Cichoń diagram for cardinal characteristics of the continuum. It is known that (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The strength of choiceless patterns of singular and weakly compact cardinals.Daniel Busche & Ralf Schindler - 2009 - Annals of Pure and Applied Logic 159 (1-2):198-248.
    We extend the core model induction technique to a choiceless context, and we exploit it to show that each one of the following two hypotheses individually implies that , the Axiom of Determinacy, holds in the of a generic extension of : every uncountable cardinal is singular, and every infinite successor cardinal is weakly compact and every uncountable limit cardinal is singular.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Forcing absoluteness and regularity properties.Daisuke Ikegami - 2010 - Annals of Pure and Applied Logic 161 (7):879-894.
    For a large natural class of forcing notions, we prove general equivalence theorems between forcing absoluteness statements, regularity properties, and transcendence properties over and the core model . We use our results to answer open questions from set theory of the reals.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • A criterion for coarse iterability.Gunter Fuchs, Itay Neeman & Ralf Schindler - 2010 - Archive for Mathematical Logic 49 (4):447-467.
    The main result of this paper is the following theorem: Let M be a premouse with a top extender, F. Suppose that (a) M is linearly coarsely iterable via hitting F and its images, and (b) if M * is a linear iterate of M as in (a), then M * is coarsely iterable with respect to iteration trees which do not use the top extender of M * and its images. Then M is coarsely iterable.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • (1 other version)Optimal proofs of determinacy.Itay Neeman - 1995 - Bulletin of Symbolic Logic 1 (3):327-339.
    In this paper I shall present a method for proving determinacy from large cardinals which, in many cases, seems to yield optimal results. One of the main applications extends theorems of Martin, Steel and Woodin about determinacy within the projective hierarchy. The method can also be used to give a new proof of Woodin's theorem about determinacy in L.The reason we look for optimal determinacy proofs is not only vanity. Such proofs serve to tighten the connection between large cardinals and (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • (1 other version)Thin equivalence relations and effective decompositions.Greg Hjorth - 1993 - Journal of Symbolic Logic 58 (4):1153-1164.
    Let E be a Σ1 1 equivalence relation for which there does not exist a perfect set of inequivalent reals. If 0# exists or if V is a forcing extension of L, then there is a good ▵1 2 well-ordering of the equivalence classes.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Analytic determinacy and 0#. [REVIEW]Leo Harrington - 1978 - Journal of Symbolic Logic 43 (4):685 - 693.
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • Combinatorics on ideals and forcing.Serge Grigorieff - 1971 - Annals of Mathematical Logic 3 (4):363.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Large cardinals and definable counterexamples to the continuum hypothesis.Matthew Foreman & Menachem Magidor - 1995 - Annals of Pure and Applied Logic 76 (1):47-97.
    In this paper we consider whether L(R) has “enough information” to contain a counterexample to the continuum hypothesis. We believe this question provides deep insight into the difficulties surrounding the continuum hypothesis. We show sufficient conditions for L(R) not to contain such a counterexample. Along the way we establish many results about nonstationary towers, non-reflecting stationary sets, generalizations of proper and semiproper forcing and Chang's conjecture.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Proper forcing extensions and Solovay models.Joan Bagaria & Roger Bosch - 2004 - Archive for Mathematical Logic 43 (6):739-750.
    We study the preservation of the property of being a Solovay model under proper projective forcing extensions. We show that every strongly-proper forcing notion preserves this property. This yields that the consistency strength of the absoluteness of under strongly-proper forcing notions is that of the existence of an inaccessible cardinal. Further, the absoluteness of under projective strongly-proper forcing notions is consistent relative to the existence of a -Mahlo cardinal. We also show that the consistency strength of the absoluteness of under (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (2 other versions)Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.
    Download  
     
    Export citation  
     
    Bookmark   327 citations