scholarly journals STABLY MEASURABLE CARDINALS

2020 ◽  
pp. 1-23
Author(s):  
P.D. WELCH
Keyword(s):  
2006 ◽  
Vol 71 (3) ◽  
pp. 1029-1043 ◽  
Author(s):  
Natasha Dobrinen ◽  
Sy-David Friedman

AbstractThis paper investigates when it is possible for a partial ordering ℙ to force Pk(Λ)\V to be stationary in Vℙ. It follows from a result of Gitik that whenever ℙ adds a new real, then Pk(Λ)\V is stationary in Vℙ for each regular uncountable cardinal κ in Vℙ and all cardinals λ ≥ κ in Vℙ [4], However, a covering theorem of Magidor implies that when no new ω-sequences are added, large cardinals become necessary [7]. The following is equiconsistent with a proper class of ω1-Erdős cardinals: If ℙ is ℵ1-Cohen forcing, then Pk(Λ)\V is stationary in Vℙ, for all regular κ ≥ ℵ2and all λ ≩ κ. The following is equiconsistent with an ω1-Erdős cardinal: If ℙ is ℵ1-Cohen forcing, then is stationary in Vℙ. The following is equiconsistent with κ measurable cardinals: If ℙ is κ-Cohen forcing, then is stationary in Vℙ.


1985 ◽  
Vol 50 (2) ◽  
pp. 531-543 ◽  
Author(s):  
Arthur W. Apter

A very fruitful line of research in recent years has been the application of techniques in large cardinals and forcing to the production of models in which certain consequences of the axiom of determinateness (AD) are true or in which certain “AD-like” consequences are true. Numerous results have been published on this subject, among them the papers of Bull and Kleinberg [4], Bull [3], Woodin [15], Mitchell [11], and [1], [2].Another such model will be constructed in this paper. Specifically, the following theorem is proven.Theorem 1. Con(ZFC + There are cardinals κ < δ < λ so that κ is a supercompact limit of supercompact cardinals, λ is a measurable cardinal, and δ is λ supercompact) ⇒ Con(ZF + ℵ1 and ℵ2 are Ramsey cardinals + The ℵn for 3 ≤ n ≤ ω are singular cardinals of cofinality ω each of which carries a Rowbottom filter + ℵω + 1 is a Ramsey cardinal + ℵω + 2 is a measurable cardinal).It is well known that under AD + DC, ℵ2 and ℵ2 are measurable cardinals, the ℵn for 3 ≤ n < ω are singular Jonsson cardinals of cofinality ℵ2, ℵω is a Rowbottom cardinal, and ℵω + 1 and ℵω + 2 are measurable cardinals.The proof of the above theorem will use the existence of normal ultrafilters which satisfy a certain property (*) (to be defined later) and an automorphism argument which draws upon the techniques developed in [9], [2], and [4] but which shows in addition that certain supercompact Prikry partial orderings are in a strong sense “homogeneous”. Before beginning the proof of the theorem, however, we briefly mention some preliminaries.


2010 ◽  
Vol 207 (2) ◽  
pp. 101-122 ◽  
Author(s):  
Sy-David Friedman ◽  
Lyubomyr Zdomskyy

2011 ◽  
Vol 76 (2) ◽  
pp. 519-540 ◽  
Author(s):  
Victoria Gitman

AbstractOne of the numerous characterizations of a Ramsey cardinal κ involves the existence of certain types of elementary embeddings for transitive sets of size κ satisfying a large fragment of ZFC. We introduce new large cardinal axioms generalizing the Ramsey elementary embeddings characterization and show that they form a natural hierarchy between weakly compact cardinals and measurable cardinals. These new axioms serve to further our knowledge about the elementary embedding properties of smaller large cardinals, in particular those still consistent with V = L.


1988 ◽  
Vol 53 (3) ◽  
pp. 736-764 ◽  
Author(s):  
Penelope Maddy

This is a continuation of Believing the axioms. I, in which nondemonstrative arguments for and against the axioms of ZFC, the continuum hypothesis, small large cardinals and measurable cardinals were discussed. I turn now to determinacy hypotheses and large large cardinals, and conclude with some philosophical remarks.Determinacy is a property of sets of reals. If A is such a set, we imagine an infinite game G(A) between two players I and II. The players take turns choosing natural numbers. In the end, they have generated a real number r (actually a member of the Baire space ωω). If r is in A, I wins; otherwise, II wins. The set A is said to be determined if one player or the other has a winning strategy (that is, a function from finite sequences of natural numbers to natural numbers that guarantees the player a win if he uses it to decide his moves).Determinacy is a “regularity” property (see Martin [1977, p. 807]), a property of well-behaved sets, that implies the more familiar regularity properties like Lebesgue measurability, the Baire property (see Mycielski [1964] and [1966], and Mycielski and Swierczkowski [1964]), and the perfect subset property (Davis [1964]). Infinitary games were first considered by the Polish descriptive set theorists Mazur and Banach in the mid-30s; Gale and Stewart [1953] introduced them into the literature, proving that open sets are determined and that the axiom of choice can be used to construct an undetermined set.


Sign in / Sign up

Export Citation Format

Share Document