The consistency strength of hyperstationarity

Journal of Mathematical Logic 20 (1):2050004 (2019)
  Copy   BIBTEX

Abstract

We introduce the large-cardinal notions of ξ-greatly-Mahlo and ξ-reflection cardinals and prove (1) in the constructible universe, L, the first ξ-reflection cardinal, for ξ a successor ordinal, is strictly between the first ξ-greatly-Mahlo and the first Π1ξ-indescribable cardinals, (2) assuming the existence of a ξ-reflection cardinal κ in L, ξ a successor ordinal, there exists a forcing notion in L that preserves cardinals and forces that κ is (ξ+1)-stationary, which implies that the consistency strength of the existence of a (ξ+1)-stationary cardinal is strictly below a Π1ξ-indescribable cardinal. These results generalize to all successor ordinals ξ the original same result of Mekler–Shelah [A. Mekler and S. Shelah, The consistency strength of every stationary set reflects, Israel J. Math.67(3) (1989) 353–365] about a 2-stationary cardinal, i.e. a cardinal that reflects all its stationary sets.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,139

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The consistency strength of an infinitary Ramsey property.George Kafkoulis - 1994 - Journal of Symbolic Logic 59 (4):1158-1195.
Reducing the consistency strength of an indestructibility theorem.Arthur Agler - 2008 - Mathematical Logic Quarterly 54 (3):288-293.
Generic absoluteness.Joan Bagaria & Sy D. Friedman - 2001 - Annals of Pure and Applied Logic 108 (1-3):3-13.
Generic absoluteness.Joan Bagaria & Sy Friedman - 2001 - Annals of Pure and Applied Logic 108 (1-3):3-13.
Slow consistency.Sy-David Friedman, Michael Rathjen & Andreas Weiermann - 2013 - Annals of Pure and Applied Logic 164 (3):382-393.
Proper forcing extensions and Solovay models.Joan Bagaria & Roger Bosch - 2004 - Archive for Mathematical Logic 43 (6):739-750.
Consistency strength of higher chang’s conjecture, without CH.Sean D. Cox - 2011 - Archive for Mathematical Logic 50 (7-8):759-775.
A remark on the tree property in a choiceless context.Arthur W. Apter - 2011 - Archive for Mathematical Logic 50 (5-6):585-590.
On the Consistency Strength of Two Choiceless Cardinal Patterns.Arthur W. Apter - 1999 - Notre Dame Journal of Formal Logic 40 (3):341-345.
The Strengths of Some Violations of Covering.Heike Mildenberger - 2001 - Mathematical Logic Quarterly 47 (3):291-298.
Reducing the consistency strength of an indestructibility theorem.Arthur W. Apter - 2008 - Mathematical Logic Quarterly 54 (3):288-293.
On the consistency strength of the Milner–Sauer conjecture.Assaf Rinot - 2006 - Annals of Pure and Applied Logic 140 (1):110-119.

Analytics

Added to PP
2019-07-22

Downloads
24 (#603,118)

6 months
4 (#573,918)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Forcing closed unbounded sets.Uri Abraham & Saharon Shelah - 1983 - Journal of Symbolic Logic 48 (3):643-657.
On partitions into stationary sets.Karel Prikry & Robert M. Solovay - 1975 - Journal of Symbolic Logic 40 (1):75-80.
Cardinal preserving ideals.Moti Gitik & Saharon Shelah - 1999 - Journal of Symbolic Logic 64 (4):1527-1551.

Add more references