Switch to: References

Add citations

You must login to add citations.
  1. New combinatorial principle on singular cardinals and normal ideals.Toshimichi Usuba - 2018 - Mathematical Logic Quarterly 64 (4-5):395-408.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Tail Club Guessing Ideal Can Be Saturated without Being a Restriction of the Nonstationary Ideal.Tetsuya Ishiu - 2005 - Notre Dame Journal of Formal Logic 46 (3):327-333.
    We outline the proof of the consistency that there exists a saturated tail club guessing ideal on ω₁ which is not a restriction of the nonstationary ideal. A new class of forcing notions and the forcing axiom for the class are introduced for this purpose.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Regularity properties of ideals and ultrafilters.Alan D. Taylor - 1979 - Annals of Mathematical Logic 16 (1):33.
  • Stationary Cardinals.Wenzhi Sun - 1993 - Archive for Mathematical Logic 32 (6):429-442.
    This paper will define a new cardinal called aStationary Cardinal. We will show that every weakly∏ 1 1 -indescribable cardinal is a stationary cardinal, every stationary cardinal is a greatly Mahlo cardinal and every stationary set of a stationary cardinal reflects. On the other hand, the existence of such a cardinal is independent of that of a∏ 1 1 -indescribable cardinal and the existence of a cardinal such that every stationary set reflects is also independent of that of a stationary (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  • In memoriam: James Earl Baumgartner (1943–2011).J. A. Larson - 2017 - Archive for Mathematical Logic 56 (7):877-909.
    James Earl Baumgartner (March 23, 1943–December 28, 2011) came of age mathematically during the emergence of forcing as a fundamental technique of set theory, and his seminal research changed the way set theory is done. He made fundamental contributions to the development of forcing, to our understanding of uncountable orders, to the partition calculus, and to large cardinals and their ideals. He promulgated the use of logic such as absoluteness and elementary submodels to solve problems in set theory, he applied (...)
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  • The approachability ideal without a maximal set.John Krueger - 2019 - Annals of Pure and Applied Logic 170 (3):297-382.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • An equiconsistency result on partial squares.John Krueger & Ernest Schimmerling - 2011 - Journal of Mathematical Logic 11 (1):29-59.
    We prove that the following two statements are equiconsistent: there exists a greatly Mahlo cardinal; there exists a regular uncountable cardinal κ such that no stationary subset of κ+ ∩ cof carries a partial square.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Some properties of κ-complete ideals defined in terms of infinite games.Thomas J. Jech - 1984 - Annals of Pure and Applied Logic 26 (1):31-45.
  • Some properties of kappa-complete ideals defined in terms of infinite games.T. J. Jech - 1984 - Annals of Pure and Applied Logic 26 (1):31.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Full reflection at a measurable cardinal.Thomas Jech & Jiří Witzany - 1994 - Journal of Symbolic Logic 59 (2):615-630.
    A stationary subset S of a regular uncountable cardinal κ reflects fully at regular cardinals if for every stationary set $T \subseteq \kappa$ of higher order consisting of regular cardinals there exists an α ∈ T such that S ∩ α is a stationary subset of α. Full Reflection states that every stationary set reflects fully at regular cardinals. We will prove that under a slightly weaker assumption than κ having the Mitchell order κ++ it is consistent that Full Reflection (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • The saturation of club guessing ideals.Tetsuya Ishiu - 2006 - Annals of Pure and Applied Logic 142 (1):398-424.
    We prove that it is consistent that there exists a saturated tail club guessing ideal on ω1 which is not a restriction of the non-stationary ideal. Two proofs are presented. The first one uses a new forcing axiom whose consistency can be proved from a supercompact cardinal. The resulting model can satisfy either CH or 20=2. The second one is a direct proof from a Woodin cardinal, which gives a witnessing model with CH.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Orders of Indescribable Sets.Alex Hellsten - 2006 - Archive for Mathematical Logic 45 (6):705-714.
    We extract some properties of Mahlo’s operation and show that some other very natural operations share these properties. The weakly compact sets form a similar hierarchy as the stationary sets. The height of this hierarchy is a large cardinal property connected to saturation properties of the weakly compact ideal.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Mitchell's theorem revisited.Thomas Gilton & John Krueger - 2017 - Annals of Pure and Applied Logic 168 (5):922-1016.
  • The Club Guessing Ideal: Commentary on a Theorem of Gitik and Shelah.Matthew Foreman & Peter Komjath - 2005 - Journal of Mathematical Logic 5 (1):99-147.
    It is shown in this paper that it is consistent (relative to almost huge cardinals) for various club guessing ideals to be saturated.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • The weakly compact reflection principle need not imply a high order of weak compactness.Brent Cody & Hiroshi Sakai - 2020 - Archive for Mathematical Logic 59 (1-2):179-196.
    The weakly compact reflection principle\\) states that \ is a weakly compact cardinal and every weakly compact subset of \ has a weakly compact proper initial segment. The weakly compact reflection principle at \ implies that \ is an \-weakly compact cardinal. In this article we show that the weakly compact reflection principle does not imply that \ is \\)-weakly compact. Moreover, we show that if the weakly compact reflection principle holds at \ then there is a forcing extension preserving (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Forcing a □(κ)-like principle to hold at a weakly compact cardinal.Brent Cody, Victoria Gitman & Chris Lambie-Hanson - 2021 - Annals of Pure and Applied Logic 172 (7):102960.
  • Adding a Nonreflecting Weakly Compact Set.Brent Cody - 2019 - Notre Dame Journal of Formal Logic 60 (3):503-521.
    For n<ω, we say that theΠn1-reflection principle holds at κ and write Refln if and only if κ is a Πn1-indescribable cardinal and every Πn1-indescribable subset of κ has a Πn1-indescribable proper initial segment. The Πn1-reflection principle Refln generalizes a certain stationary reflection principle and implies that κ is Πn1-indescribable of order ω. We define a forcing which shows that the converse of this implication can be false in the case n=1; that is, we show that κ being Π11-indescribable of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Generalizing the Mahlo Hierarchy, with Applications to the Mitchell Models.Stewart Baldwin - 1983 - Annals of Pure and Applied Logic 25 (2):103-127.
  • Proof theory of weak compactness.Toshiyasu Arai - 2013 - Journal of Mathematical Logic 13 (1):1350003.
    We show that the existence of a weakly compact cardinal over the Zermelo–Fraenkel's set theory ZF is proof-theoretically reducible to iterations of Mostowski collapsings and Mahlo operations.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations