Switch to: References

Add citations

You must login to add citations.
  1. Recognizable sets and Woodin cardinals: computation beyond the constructible universe.Merlin Carl, Philipp Schlicht & Philip Welch - 2018 - Annals of Pure and Applied Logic 169 (4):312-332.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Covering theorems for the core model, and an application to stationary set reflection.Sean Cox - 2010 - Annals of Pure and Applied Logic 161 (1):66-93.
    We prove covering theorems for K, where K is the core model below the sharp for a strong cardinal, and give an application to stationary set reflection.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • On Easton Support Iteration of Prikry-Type Forcing Notions.Moti Gitik & Eyal Kaplan - forthcoming - Journal of Symbolic Logic:1-46.
    We consider of constructing normal ultrafilters in extensions are here Easton support iterations of Prikry-type forcing notions. New ways presented. It turns out that, in contrast with other supports, seemingly unrelated measures or extenders can be involved here.
    Download  
     
    Export citation  
     
    Bookmark  
  • Realizing an AD + model as a derived model of a premouse.Yizheng Zhu - 2015 - Annals of Pure and Applied Logic 166 (12):1275-1364.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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  
  • 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  
  • A premouse inheriting strong cardinals from V.Farmer Schlutzenberg - 2020 - Annals of Pure and Applied Logic 171 (9):102826.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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  
  • Determinacy of refinements to the difference hierarchy of co-analytic sets.Chris Le Sueur - 2018 - Annals of Pure and Applied Logic 169 (1):83-115.
    Download  
     
    Export citation  
     
    Bookmark  
  • O tzw. programie Gödla.Krzysztof Wójtowicz - 2001 - Zagadnienia Filozoficzne W Nauce 29.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)The Mitchell order below rank-to-rank.Itay Neeman - 2004 - Journal of Symbolic Logic 69 (4):1143-1162.
    We show that Mitchell order on downward closed extenders below rank-to-rank type is wellfounded.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The comparison lemma.John R. Steel - forthcoming - Annals of Pure and Applied Logic.
    Download  
     
    Export citation  
     
    Bookmark  
  • Definable normal measures.Sy-David Friedman & Liuzhen Wu - 2015 - Annals of Pure and Applied Logic 166 (1):46-60.
    Download  
     
    Export citation  
     
    Bookmark