An application of ultrapowers to changing cofinality

1983 ◽  
Vol 48 (2) ◽  
pp. 225-235 ◽  
Author(s):  
Patrick Dehornoy

The problem of changing the cofinality of a measurable cardinal to ω with the help of an iterated ultrapower construction has been introduced in [Bu] and more completely studied in [De]. The aim of this paper is to investigate how the construction above has to be changed to obtain an uncountable cofinality for the (previously) measurable cardinal.A forcing approach of this question has been developed by Magidor in [Ma]. Just as in the countable case with Prikry forcing, it turns out that the needed hypothesis and the models constructed are the same in both techniques. However the ultrapowers yield a solution which may appear as more effective. In particular the sequence used to change the measurable cardinal into a cardinal of cofinality α has the property that for any β < α the restriction to β of this sequence can be used to change the cofinality of the (same) measurable cardinal to β.The result we prove is as follows:Theorem. Assume that α is a limit ordinal, that (Uβ)β<α is a sequence of complete ultrafilters on κ > α in the model N0, andfor B included in α let NB be the ultrapower of N0 by those Uβ which are such that β is in B.


2013 ◽  
Vol 78 (1) ◽  
pp. 85-100 ◽  
Author(s):  
Peter Koepke ◽  
Karen Räsch ◽  
Philipp Schlicht

AbstractRecently, Gitik, Kanovei and the first author proved that for a classical Prikry forcing extension the family of the intermediate models can be parametrized by /finite. By modifying the standard Prikry tree forcing we define a Prikry-type forcing which also singularizes a measurable cardinal but which is minimal, i.e., there are no intermediate models properly between the ground model and the generic extension. The proof relies on combining the rigidity of the tree structure with indiscernibility arguments resulting from the normality of the associated measures.



1972 ◽  
Vol 37 (4) ◽  
pp. 677-682 ◽  
Author(s):  
George Metakides

Let α be a limit ordinal with the property that any “recursive” function whose domain is a proper initial segment of α has its range bounded by α. α is then called admissible (in a sense to be made precise later) and a recursion theory can be developed on it (α-recursion theory) by providing the generalized notions of α-recursively enumerable, α-recursive and α-finite. Takeuti [12] was the first to study recursive functions of ordinals, the subject owing its further development to Kripke [7], Platek [8], Kreisel [6], and Sacks [9].Infinitary logic on the other hand (i.e., the study of languages which allow expressions of infinite length) was quite extensively studied by Scott [11], Tarski, Kreisel, Karp [5] and others. Kreisel suggested in the late '50's that these languages (even which allows countable expressions but only finite quantification) were too large and that one should only allow expressions which are, in some generalized sense, finite. This made the application of generalized recursion theory to the logic of infinitary languages appear natural. In 1967 Barwise [1] was the first to present a complete formalization of the restriction of to an admissible fragment (A a countable admissible set) and to prove that completeness and compactness hold for it. [2] is an excellent reference for a detailed exposition of admissible languages.



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.



2021 ◽  
Vol 27 (2) ◽  
pp. 221-222
Author(s):  
Alejandro Poveda

AbstractThe dissertation under comment is a contribution to the area of Set Theory concerned with the interactions between the method of Forcing and the so-called Large Cardinal axioms.The dissertation is divided into two thematic blocks. In Block I we analyze the large-cardinal hierarchy between the first supercompact cardinal and Vopěnka’s Principle (Part I). In turn, Block II is devoted to the investigation of some problems arising from Singular Cardinal Combinatorics (Part II and Part III).We commence Part I by investigating the Identity Crisis phenomenon in the region comprised between the first supercompact cardinal and Vopěnka’s Principle. As a result, we generalize Magidor’s classical theorems [2] to this higher region of the large-cardinal hierarchy. Also, our analysis allows to settle all the questions that were left open in [1]. Finally, we conclude Part I by presenting a general theory of preservation of $C^{(n)}$ -extendible cardinals under class forcing iterations. From this analysis we derive several applications. For instance, our arguments are used to show that an extendible cardinal is consistent with “ $(\lambda ^{+\omega })^{\mathrm {HOD}}<\lambda ^+$ , for every regular cardinal $\lambda $ .” In particular, if Woodin’s HOD Conjecture holds, and therefore it is provable in ZFC + “There exists an extendible cardinal” that above the first extendible cardinal every singular cardinal $\lambda $ is singular in HOD and $(\lambda ^+)^{\textrm {{HOD}}}=\lambda ^+$ , there may still be no agreement at all between V and HOD about successors of regular cardinals.In Part II and Part III we analyse the relationship between the Singular Cardinal Hypothesis (SCH) with other relevant combinatorial principles at the level of successors of singular cardinals. Two of these are the Tree Property and the Reflection of Stationary sets, which are central in Infinite Combinatorics.Specifically, Part II is devoted to prove the consistency of the Tree Property at both $\kappa ^+$ and $\kappa ^{++}$ , whenever $\kappa $ is a strong limit singular cardinal witnessing an arbitrary failure of the SCH. This generalizes the main result of [3] in two senses: it allows arbitrary cofinalities for $\kappa $ and arbitrary failures for the SCH.In the last part of the dissertation (Part III) we introduce the notion of $\Sigma $ -Prikry forcing. This new concept allows an abstract and uniform approach to the theory of Prikry-type forcings and encompasses several classical examples of Prikry-type forcing notions, such as the classical Prikry forcing, the Gitik-Sharon poset, or the Extender Based Prikry forcing, among many others.Our motivation in this part of the dissertation is to prove an iteration theorem at the level of the successor of a singular cardinal. Specifically, we aim for a theorem asserting that every $\kappa ^{++}$ -length iteration with support of size $\leq \kappa $ has the $\kappa ^{++}$ -cc, provided the iterates belong to a relevant class of $\kappa ^{++}$ -cc forcings. While there are a myriad of works on this vein for regular cardinals, this contrasts with the dearth of investigations in the parallel context of singular cardinals. Our main contribution is the proof that such a result is available whenever the class of forcings under consideration is the family of $\Sigma $ -Prikry forcings. Finally, and as an application, we prove that it is consistent—modulo large cardinals—the existence of a strong limit cardinal $\kappa $ with countable cofinality such that $\mathrm {SCH}_\kappa $ fails and every finite family of stationary subsets of $\kappa ^+$ reflects simultaneously.





2013 ◽  
Vol 223 (1) ◽  
pp. 55-64 ◽  
Author(s):  
Sy-David Friedman ◽  
Ajdin Halilović


1985 ◽  
Vol 28 (4) ◽  
pp. 472-473
Author(s):  
Arthur W. Apter

AbstractIn this note, we construct a model with a normal measure U over a measurable cardinal κ so that the cardinal structures of V and Vκ/U are the same ≤2κ. We then show that it is possible to construct a model where this is not true.



1970 ◽  
Vol 22 (6) ◽  
pp. 1118-1122 ◽  
Author(s):  
Doyle O. Cutler ◽  
Paul F. Dubois

Let G be a p-primary Abelian group. Recall that the final rank of G is infn∈ω{r(pnG)}, where r(pnG) is the rank of pnG and ω is the first limit ordinal. Alternately, if Γ is the set of all basic subgroups of G, we may define the final rank of G by supB∈Γ {r(G/B)}. In fact, it is known that there exists a basic subgroup B of G such that r(G/B) is equal to the final rank of G. Since the final rank of G is equal to the final rank of a high subgroup of G plus the rank of pωG, one could obtain the same information if the definition of final rank were restricted to the class of p-primary Abelian groups of length ω.



1960 ◽  
Vol 12 ◽  
pp. 483-487
Author(s):  
George Kolettis

In (1) Baer studied the following problem: If a torsion-free abelian group G is a direct sum of groups of rank one, is every direct summand of G also a direct sum of groups of rank one? For groups satisfying a certain chain condition, Baer gave a solution. Kulikov, in (3), supplied an affirmative answer, assuming only that G is countable. In a recent paper (2), Kaplansky settles the issue by reducing the general case to the countable case where Kulikov's solution is applicable. As usual, the result extends to modules over a principal ideal ring R (commutative with unit, no divisors of zero, every ideal principal).The object of this paper is to carry out a similar investigation for pure submodules, a somewhat larger class of submodules than the class of direct summands. We ask: if the torsion-free i?-module M is a direct sum of modules of rank one, is every pure submodule N of M also a direct sum of modules of rank one? Unlike the situation for direct summands, here the answer depends heavily on the ring R.



2019 ◽  
Vol 59 (1-2) ◽  
pp. 81-102
Author(s):  
Kaethe Minden
Keyword(s):  


Sign in / Sign up

Export Citation Format

Share Document