Switch to: References

Add citations

You must login to add citations.
  1. Stationary Reflection and the Failure of the Sch.Omer Ben-Neria, Yair Hayut & Spencer Unger - 2024 - Journal of Symbolic Logic 89 (1):1-26.
    In this paper we prove that from large cardinals it is consistent that there is a singular strong limit cardinal $\nu $ such that the singular cardinal hypothesis fails at $\nu $ and every collection of fewer than $\operatorname {\mathrm {cf}}(\nu )$ stationary subsets of $\nu ^{+}$ reflects simultaneously. For $\operatorname {\mathrm {cf}}(\nu )> \omega $, this situation was not previously known to be consistent. Using different methods, we reduce the upper bound on the consistency strength of this situation for (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Large cardinals at the brink.W. Hugh Woodin - 2024 - Annals of Pure and Applied Logic 175 (1):103328.
    Download  
     
    Export citation  
     
    Bookmark  
  • A Mathias criterion for the Magidor iteration of Prikry forcings.Omer Ben-Neria - 2023 - Archive for Mathematical Logic 63 (1):119-134.
    We prove a Mathias-type criterion for the Magidor iteration of Prikry forcings.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Set-theoretic geology.Gunter Fuchs, Joel David Hamkins & Jonas Reitz - 2015 - Annals of Pure and Applied Logic 166 (4):464-501.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Generalized Prikry forcing and iteration of generic ultrapowers.Hiroshi Sakai - 2005 - Mathematical Logic Quarterly 51 (5):507-523.
    It is known that there is a close relation between Prikry forcing and the iteration of ultrapowers: If U is a normal ultrafilter on a measurable cardinal κ and 〈Mn, jm,n | m ≤ n ≤ ω〉 is the iteration of ultrapowers of V by U, then the sequence of critical points 〈j0,n | n ∈ ω〉 is a Prikry generic sequence over Mω. In this paper we generalize this for normal precipitous filters.
    Download  
     
    Export citation  
     
    Bookmark  
  • Canonical seeds and Prikry trees.Joel David Hamkins - 1997 - Journal of Symbolic Logic 62 (2):373-396.
    Applying the seed concept to Prikry tree forcing P μ , I investigate how well P μ preserves the maximality property of ordinary Prikry forcing and prove that P μ Prikry sequences are maximal exactly when μ admits no non-canonical seeds via a finite iteration. In particular, I conclude that if μ is a strongly normal supercompactness measure, then P μ Prikry sequences are maximal, thereby proving, for a large class of measures, a conjecture of W. Hugh Woodin's.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • An application of ultrapowers to changing cofinality.Patrick Dehornoy - 1983 - Journal of Symbolic Logic 48 (2):225-235.
    If $U_\alpha$ is a length $\omega_1$ sequence of normal ultrafilters on a measurable cardinal $\kappa$ that is increaing w.r.t. the Mitchel order, then the intersection of the $\omega_1$ first iterated ultrapowers of the universe is a Magidor generic extension of the $\omega_1$th iterated ultrapower.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Iterating the Cofinality- Constructible Model.Ur Ya’Ar - 2023 - Journal of Symbolic Logic 88 (4):1682-1691.
    We investigate iterating the construction of $C^{*}$, the L-like inner model constructed using first order logic augmented with the “cofinality $\omega $ ” quantifier. We first show that $\left (C^{*}\right )^{C^{*}}=C^{*}\ne L$ is equiconsistent with $\mathrm {ZFC}$, as well as having finite strictly decreasing sequences of iterated $C^{*}$ s. We then show that in models of the form $L[U]$ we get infinite decreasing sequences of length $\omega $, and that an inner model with a measurable cardinal is required for that.
    Download  
     
    Export citation  
     
    Bookmark  
  • Stationary reflection.Yair Hayut & Spencer Unger - 2020 - Journal of Symbolic Logic 85 (3):937-959.
    We improve the upper bound for the consistency strength of stationary reflection at successors of singular cardinals.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Prikry forcing and tree Prikry forcing of various filters.Tom Benhamou - 2019 - Archive for Mathematical Logic 58 (7-8):787-817.
    In this paper, we answer a question asked in Koepke et al. regarding a Mathias criteria for Tree-Prikry forcing. Also we will investigate Prikry forcing using various filters. For completeness and self inclusion reasons, we will give proofs of many known theorems.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The covering lemma for L[U].A. J. Dodd & R. B. Jensen - 1982 - Annals of Mathematical Logic 22 (2):127-135.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • About Prikry generic extensions.Claude Sureson - 1991 - Annals of Pure and Applied Logic 51 (3):247-278.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Minimal collapsing extensions of models of zfc.Lev Bukovský & Eva Copláková-Hartová - 1990 - Annals of Pure and Applied Logic 46 (3):265-298.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • A new characterization of supercompactness and applications.Qi Feng - 2009 - Annals of Pure and Applied Logic 160 (2):192-213.
    We give a new characterization of λ-supercompact cardinal κ in terms of -Solovay pairs. We give some applications of -Solovay pairs.
    Download  
     
    Export citation  
     
    Bookmark  
  • Nonabsoluteness of elementary embeddings.Friedrich Wehrung - 1989 - Journal of Symbolic Logic 54 (3):774-778.
    Ifκis a measurable cardinal, let us say that a measure onκis aκ-complete nonprincipal ultrafilter onκ. IfUis a measure onκ, letjUbe the canonical elementary embedding ofVinto its Ultrapower UltU. Ifxis a set, say thatUmovesxwhenjU≠x; say thatκmovesxwhen some measure onκmovesx. Recall Kunen's lemma : “Every ordinal is moved only by finitely many measurable cardinals.” Kunen's proof and Fleissner's proof are essentially nonconstructive.The following proposition can be proved by using elementary facts about iterated ultrapowers.Proposition.Let ‹Un: n ∈ ω› be a sequence of measures (...)
    Download  
     
    Export citation  
     
    Bookmark