In their paper from 1981, Milner and Sauer conjectured that for any poset $\langle P,\le\rangle$ , if $cf(P,\le)=\lambda>cf(\lambda)=\kappa$ , then P must contain an antichain of size κ. We prove that for λ > cf(λ) = κ, if there exists a cardinal μ < λ such that cov(λ, μ, κ, 2) = λ, then any poset of cofinality λ contains λ κ antichains of size κ. The hypothesis of our theorem is very weak and is a consequence of many (...) well-known axioms such as GCH, SSH and PFA. The consistency of the negation of this hypothesis is unknown. (shrink)

Let μ be singular of uncountable cofinality. If μ > 2cf(μ), we prove that in P = ([μ]μ, ⊇) as a forcing notion we have a natural complete embedding of Levy (‮א‬₀, μ⁺) (so P collapses μ⁺ to ‮א‬₀) and even Levy ($(\aleph _{0},U_{J_{\kappa}^{{\rm bd}}}(\mu))$). The "natural" means that the forcing ({p ∈ [μ]μ: p closed}, ⊇) is naturally embedded and is equivalent to the Levy algebra. Also if P fails the χ-c.c. then it collapses χ to ‮א‬₀ (...) (and the parallel results for the case μ > ‮א‬₀ is regular or of countable cofinality). Moreover we prove: for regular uncountable κ, there is a family P of bκ partitions Ā = 〈Aα: α < κ〉 of κ such that for any A ∈ [κ]κ for some 〈Aα: α < κ〉 ∈ P we have α < κ ⇒ |Aα ⋂ A| = κ. (shrink)

A new method for blowing up the power of a singular cardinal is presented. It allows to blow up the power of a singular in the core model cardinal of uncountable cofinality. The method makes use of overlapping extenders.

Does every partial order of singular cofinality λ have an antichain of size ? This is the Singular Cofinality Conjecture. M. Pouzet proved [M. Pouzet, Parties cofinales des ordres partiels ne contenant pas d’antichaines infinies, 1980, preprint] that there must be an infinite antichain. When is uncountable, the positive answer is only consistently true, but unknown in ZFC. In this note we investigate this question from the purely set-theoretic point of view. On the way, we answer (...) a question of Milner and Pouzet from [E.C. Milner, M. Pouzet, Posets with singular cofinality, 1997, preprint]. (shrink)

We present a new technique for changing the cofinality of large cardinals using homogeneous forcing. As an application we show that many singular cardinals in [Formula: see text] can be measurable in HOD. We also answer a related question of Cummings, Friedman and Golshani by producing a model in which every regular uncountable cardinal [Formula: see text] in [Formula: see text] is [Formula: see text]-supercompact in HOD.

Let S be the group of all permutations of the set of natural numbers. The cofinality spectrum CF(S) of S is the set of all regular cardinals λ such that S can be expressed as the union of a chain of λ proper subgroups. This paper investigates which sets C of regular uncountable cardinals can be the cofinality spectrum of S. The following theorem is the main result of this paper. Theorem. Suppose that $V \models GCH$ . Let (...) C be a set of regular uncountable cardinals which satisfies the following conditions. (a) C contains a maximum element. (b) If μ is an inaccessible cardinal such that $\mu = \sup(C \cap \mu)$ , then μ ∈ C. (c) If μ is a singular cardinal such that $\mu = \sup(C \cap \mu)$ , then μ + ∈ C. Then there exists a c.c.c. notion of forcing P such that $V^\mathbb{P} \models CF(S) = C$ . We shall also investigate the connections between the cofinality spectrum and pcf theory; and show that CF(S) cannot be an arbitrarily prescribed set of regular uncountable cardinals. (shrink)

We use Shelah's theory of possible cofinalities in order to solve some problems about ultrafilters. Theorem: Suppose that $\lambda$ is a singular cardinal, $\lambda ' \lessthan \lambda$, and the ultrafilter $D$ is $\kappa$ -decomposable for all regular cardinals $\kappa$ with $\lambda '\lessthan \kappa \lessthan \lambda$. Then $D$ is either $\lambda$-decomposable or $\lambda ^+$-decomposable. Corollary: If $\lambda$ is a singular cardinal, then an ultrafilter is ($\lambda$,$\lambda$)-regular if and only if it is either $\operator{cf} \lambda$-decomposable or $\lambda^+$-decomposable. We also give (...) applications to topological spaces and to abstract logics. (shrink)

We say that κ is μ-hypermeasurable for a cardinal μ≥κ+ if there is an embedding j:V→M with critical point κ such that HV is included in M and j>μ. Such a j is called a witnessing embedding.Building on the results in [7], we will show that if V satisfies GCH and F is an Easton function from the regular cardinals into cardinals satisfying some mild restrictions, then there exists a cardinal-preserving forcing extension V* where F is realised on all V-regular (...) cardinals and moreover, all F-hypermeasurable cardinals κ, where F>κ+, with a witnessing embedding j such that either j=κ+ or j≥F, are turned into singular strong limit cardinals with cofinality ω. This provides some partial information about the possible structure of a continuum function with respect to singular cardinals with countable cofinality.As a corollary, this shows that the continuum function on a singular strong limit cardinal κ of cofinality ω is virtually independent of the behaviour of the continuum function below κ, at least for continuum functions which are simple in that 2α{α+,α++} for every cardinal α below κ ≥F or j=κ+). (shrink)

In this paper we investigate some properties of forcing which can be considered “nice” in the context of singularizing regular cardinals to have an uncountable cofinality. We show that such forcing which changes cofinality of a regular cardinal, cannot be too nice and must cause some “damage” to the structure of cardinals and stationary sets. As a consequence there is no analogue to the Prikry forcing, in terms of “nice” properties, when changing cofinalities to be uncountable.

Given a regular cardinal λ and λ many supercompact cardinals, we describe a type of forcing such that in the generic extension there is a cardinal κ with cofinality λ, the Singular Cardinal Hypothesis at κ fails, and the tree property holds at κ+.

In this paper, we investigate the extent to which techniques used in [10], [2], and [3]—developed to prove coloring theorems at successors of singular cardinals of uncountable cofinality—can be extended to cover the countable cofinality case.

Some subfamilies of κ, for κ regular, κ λ, called -semimorasses are investigated. For λ = κ+, they constitute weak versions of Velleman's simplified -morasses, and for λ > κ+, they provide a combinatorial framework which in some cases has similar applications to the application of -morasses with this difference that the obtained objects are of size λ κ+, and not only of size κ+ as in the case of morasses. New consistency results involve existence of nonreflecting objects of (...) class='Hi'>singular sizes of uncountable cofinality such as a nonreflecting stationary set in κ, a nonreflecting nonmetrizable space of size λ, a nonreflecting nonspecial tree of size λ. We also characterize possible minimal sizes of nonspecial trees without uncountable branches. (shrink)

The tree property at κ+ states that there are no Aronszajn trees on κ+, or, equivalently, that every κ+ tree has a cofinal branch. For singular strong limit cardinals κ, there is tension between the tree property at κ+ and failure of the singular cardinal hypothesis at κ; the former is typically the result of the presence of strongly compact cardinals in the background, and the latter is impossible above strongly compacts. In this paper, we reconcile the two. (...) We prove from large cardinals that the tree property at κ+ is consistent with failure of the singular cardinal hypothesis at κ. (shrink)

The strong tree property and ITP (also called the super tree property) are generalizations of the tree property that characterize strong compactness and supercompactness up to inaccessibility. That is, an inaccessible cardinal $\kappa $ is strongly compact if and only if the strong tree property holds at $\kappa $, and supercompact if and only if ITP holds at $\kappa $. We present several results motivated by the problem of obtaining the strong tree property and ITP at many successive cardinals simultaneously; (...) these results focus on the successors of singular cardinals. We describe a general class of forcings that will obtain the strong tree property and ITP at the successor of a singular cardinal of any cofinality. Generalizing a result of Neeman about the tree property, we show that it is consistent for ITP to hold at $\aleph _n$ for all $2 \leq n < \omega $ simultaneously with the strong tree property at $\aleph _{\omega +1}$ ; we also show that it is consistent for ITP to hold at $\aleph _n$ for all $3 < n < \omega $ and at $\aleph _{\omega +1}$ simultaneously. Finally, turning our attention to singular cardinals of uncountable cofinality, we show that it is consistent for the strong and super tree properties to hold at successors of singulars of multiple cofinalities simultaneously. (shrink)

The paper is concerned with the existence of a universal graph at the successor of a strong limit singular μ of cofinality ℵ0. Starting from the assumption of the existence of a supercompact cardinal, a model is built in which for some such μ there are $\mu^{++}$ graphs on μ+ that taken jointly are universal for the graphs on μ+, while $2^{\mu^+} \gg \mu^{++}$ . The paper also addresses the general problem of obtaining a framework for consistency results (...) at the successor of a singular strong limit starting from the assumption that a supercompact cardinal κ exists. The result on the existence of universal graphs is obtained as a specific application of a more general method. (shrink)

From large cardinals we obtain the consistency of the existence of a singular cardinal κ of cofinality ω at which the Singular Cardinals Hypothesis fails, there is a bad scale at κ and κ ++ has the tree property. In particular this model has no special κ +-trees.

REF is the statement that every stationary subset of a cardinal reflects, unless it fails to do so for a trivial reason. The main theorem, presented in Sect. 0, is that under suitable assumptions it is consistent that REF and there is a κ which is κ+n -supercompact. The main concepts defined in Sect. 1 are PT, which is a certain statement about the existence of transversals, and the “bad” stationary set. It is shown that supercompactness (and even the failure (...) of PT) implies the existence of non-reflecting stationary sets. E.g., if REF then for manyλ ⌝ PT(λ, ℵ1). In Sect. 2 it is shown that Easton-support iteration of suitable Levy collapses yield a universe with REF if for every singular λ which is a limit of supercompacts the bad stationary set concentrates on the “right” cofinalities. In Sect. 3 the use of oracle c.c. (and oracle proper—see [Sh-b, Chap. IV] and [Sh 100, Sect. 4]) is adapted to replacing the diamond by the Laver diamond. Using this, a universe as needed in Sect. 2 is forced, where one starts, and ends, with a universe with a proper class of supercompacts. In Sect. 4 bad sets are handled in ZFC. For a regular λ {δ<+ : cfδ<λ} is good. It is proved in ZFC that ifλ=cfλ>ℵ1 then {α<+ : cfα<λ} is the union of λ sets on which there are squares. (shrink)

We prove several results giving lower bounds for the large cardinal strength of a failure of the singular cardinal hypothesis. The main result is the following theorem: Theorem. Suppose κ is a singular strong limit cardinal and 2κ λ where λ is not the successor of a cardinal of cofinality at most κ. If cf > ω then it follows that o λ, and if cf = ωthen either o λ or {α: K o α+n} is confinal (...) in κ for each n ε ω.We also prove several results which extend or are related to this result, notably Theorem. If 2ω ω1 then there is a sharp for a model with a strong cardinal.In order to prove these theorems we give a detailed analysis of the sequences of indiscernibles which come from applying the covering lemma to nonoverlapping sequences of extenders. (shrink)

We show that the tree property, stationary reflection and the failure of approachability at \ are consistent with \= \kappa ^+ < 2^\kappa \), where \ is a singular strong limit cardinal with the countable or uncountable cofinality. As a by-product, we show that if \ is a regular cardinal, then stationary reflection at \ is indestructible under all \-cc forcings.

Suppose that λ is the successor of a singular cardinal μ whose cofinality is an uncountable cardinal κ. We give a sufficient condition that the club filter of λ concentrating on the points of cofinality κ is not λ+-saturated.1 The condition is phrased in terms of a notion that we call weak reflection. We discuss various properties of weak reflection. We introduce a weak version of the ♣-principle, which we call ♣*−, and show that if it holds (...) on a stationary subset S of λ, then no normal filter on S is λ+-saturated. Under the above assumptions, ♣*− is true for any stationary subset S of λ which does not contain points of cofinality κ. For stationary sets S which concentrate on points of cofinality κ, we show that ♣*− holds modulo an ideal obtained through the weak reflection. (shrink)

The paper is concerned with methods for blowing power of singular cardinals using short extenders. Thus, for example, starting with κ of cofinality ω with {α<κ oα+n} cofinal in κ for every n<ω we construct a cardinal preserving extension having the same bounded subsets of κ and satisfying 2κ=κ+δ+1 for any δ<1.

Suppose $\lambda$ is a singular cardinal of uncountable cofinality $\kappa$. For a model $\mathscr{M}$ of cardinality $\lambda$, let No ($\mathscr{M}$) denote the number of isomorphism types of models $\mathscr{N}$ of cardinality $\lambda$ which are L$_{\infty\lambda}$- equivalent to $\mathscr{M}$. In [7] Shelah considered inverse $\kappa$- systems $\mathscr{A}$ of abelian groups and their certain kind of quotient limits Gr($\mathscr{A}$)/ Fact($\mathscr{A}$). In particular Shelah proved in [7, Fact 3.10] that for every cardinal $\mu$ there exists an inverse $\kappa$-system $\mathscr{A}$ such that (...) $\mathscr{A}$ consists of abelian groups having cardinality at most $\mu^\kappa$ and card(Gr($\mathscr{A}$)/Fact($\mathscr{A}$)) = $\mu$. Later in [8, Theorem 3.3] Shelah showed a strict connection between inverse $\kappa$-systems and possible values of No (under the assumption that $\theta^\kappa < \lambda$ for every $\theta < \lambda$): if $\mathscr{A}$ is an inverse $\kappa$- system of abelian groups having cardinality < $\lambda$, then there is a model $\mathscr{M}$ such that card $(\mathscr{M}) = \lambda$ and No($\mathscr{M}$) = card(Gr($\mathscr{A}$)/Fact($\mathscr{A}$)). The following was an immediate consequence (when $\theta^\kappa < \lambda$ for every $\theta < \lambda$): for every nonzero $\mu < \lambda$ or $\mu = \lambda^\kappa$ there is a model $\mathscr{M}_\mu$ of cardinality $\lambda$ with No$(\mathscr{M}_\mu) = \mu$. In this paper we show: for every nonzero $\mu \leq \lambda^\kappa$ there is an inverse $\kappa$-system $\mathscr{A}$ of abelian groups having cardinality < $\lambda$ such that card(Gr($\mathscr{A}$)/Fact($\mathscr{A}$)) = $\mu$ (under the assumptions $2^\kappa < \lambda$ and $\theta^{<\kappa} < \lambda$ for all $\theta < \lambda$ when $\mu > \lambda$), with the obvious new consequence concerning the possible value of No. Specifically, the case No($\mathscr{M}$) = $\lambda$ is possible when $\theta^\kappa < \lambda$ for every $\theta < \lambda$. (shrink)

Suppose λ is a singular cardinal of uncountable cofinality κ. For a model M of cardinality λ, let No (M) denote the number of isomorphism types of models N of cardinality λ which are L ∞λ - equivalent to M. In [7] Shelah considered inverse κ- systems A of abelian groups and their certain kind of quotient limits Gr(A)/ Fact(A). In particular Shelah proved in [7, Fact 3.10] that for every cardinal μ there exists an inverse κ-system A (...) such that A consists of abelian groups having cardinality at most μ κ and card(Gr(A)/Fact(A)) = μ. Later in [8, Theorem 3.3] Shelah showed a strict connection between inverse κ-systems and possible values of No (under the assumption that $\theta^\kappa for every $\theta ): if A is an inverse κ- system of abelian groups having cardinality $\theta^\kappa for every $\theta ): for every nonzero $\mu or μ = λ κ there is a model M μ of cardinality λ with No(M μ ) = μ. In this paper we show: for every nonzero μ ≤ λ κ there is an inverse κ-system A of abelian groups having cardinality $2^\kappa and $\theta^{ for all $\theta when $\mu > \lambda$ ), with the obvious new consequence concerning the possible value of No. Specifically, the case No(M) = λ is possible when $\theta^\kappa for every $\theta. (shrink)

We give a new characterization of the nonstationary ideal on \\) in the case when \ is a regular uncountable cardinal and \ a singular strong limit cardinal of cofinality at least \.

We determine exact consistency strengths for various failures of the Singular Cardinals Hypothesis (SCH) in the setting of the Zermelo-Fraenkel axiom system ZF without the Axiom of Choice (AC). By the new notion of parallel Prikry forcing that we introduce, we obtain surjective failures of SCH using only one measurable cardinal, including a surjective failure of Shelah's pcf theorem about the size of the power set of $\aleph _{\omega}$ . Using symmetric collapses to $\aleph _{\omega}$ , $\aleph _{\omega _{1}}$ (...) , or $\aleph _{\omega _{2}}$ , we show that injective failures at $\aleph _{\omega}$ , $\aleph _{\omega _{1}}$ , or $\aleph _{\omega _{2}}$ can have relatively mild consistency strengths in terms of Mitchell orders of measurable cardinals. Injective failures of both the aforementioned theorem of Shelah and Silver's theorem that GCH cannot first fail at a singular strong limit cardinal of uncountable cofinality are also obtained. Lower bounds are shown by core model techniques and methods due to Gitik and Mitchell. (shrink)

In Part I of this series [A. Poveda, A. Rinot and D. Sinapova, Sigma-Prikry forcing I: The axioms, Canad. J. Math. 73(5) (2021) 1205–1238], we introduced a class of notions of forcing which we call [Formula: see text]-Prikry, and showed that many of the known Prikry-type notions of forcing that center around singular cardinals of countable cofinality are [Formula: see text]-Prikry. We showed that given a [Formula: see text]-Prikry poset [Formula: see text] and a [Formula: see text]-name for (...) a non-reflecting stationary set [Formula: see text], there exists a corresponding [Formula: see text]-Prikry poset that projects to [Formula: see text] and kills the stationarity of [Formula: see text]. In this paper, we develop a general scheme for iterating [Formula: see text]-Prikry posets and, as an application, we blow up the power of a countable limit of Laver-indestructible supercompact cardinals, and then iteratively kill all non-reflecting stationary subsets of its successor. This yields a model in which the singular cardinal hypothesis fails and simultaneous reflection of finite families of stationary sets holds. (shrink)

Journal of Mathematical Logic, Volume 22, Issue 03, December 2022. In Part I of this series [A. Poveda, A. Rinot and D. Sinapova, Sigma-Prikry forcing I: The axioms, Canad. J. Math. 73(5) (2021) 1205–1238], we introduced a class of notions of forcing which we call [math]-Prikry, and showed that many of the known Prikry-type notions of forcing that center around singular cardinals of countable cofinality are [math]-Prikry. We showed that given a [math]-Prikry poset [math] and a [math]-name for (...) a non-reflecting stationary set [math], there exists a corresponding [math]-Prikry poset that projects to [math] and kills the stationarity of [math]. In this paper, we develop a general scheme for iterating [math]-Prikry posets and, as an application, we blow up the power of a countable limit of Laver-indestructible supercompact cardinals, and then iteratively kill all non-reflecting stationary subsets of its successor. This yields a model in which the singular cardinal hypothesis fails and simultaneous reflection of finite families of stationary sets holds. (shrink)

We investigate pseudopowers of singular cardinals and deduce some consequences for covering numbers at singular cardinals of uncountable cofinality.

The purpose of the present paper is to present new methods of blowing up the power of a singular cardinal κ of cofinality ω. New PCF configurations are obtained. The techniques developed here will be used in a subsequent paper to construct a model with a countable set which pcf has cardinality ℵ1.

Let Λ be a singular cardinal of uncountable confinality ψ. Under various assumptions about the sizes of covering families for cardinals below Λ, we prove upper bounds for the covering number cov(Λ, Λ, v⁺, 2). This covering number is closely related to the cofinality of the partial order ([Λ]", ⊆).

If θ is any singular cardinal of cofinality ω 1 , we produce a forcing extension in which MA holds below θ but fails at θ. The failure is due to a partial order which splits a gap of size θ in P(ω).

We show that the theory, consisting of the usual axioms of but with the power set axiom removed—specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every set can be well‐ordered—is weaker than commonly supposed and is inadequate to establish several basic facts often desired in its context. For example, there are models of in which ω1 is singular, in which every set of reals is countable, yet ω1 exists, in which there are sets (...) of reals of every size, but none of size, and therefore, in which the collection axiom fails; there are models of for which the Łoś theorem fails, even when the ultrapower is well‐founded and the measure exists inside the model; there are models of for which the Gaifman theorem fails, in that there is an embedding of models that is Σ1‐elementary and cofinal, but not elementary; there are elementary embeddings of models whose cofinal restriction is not elementary. Moreover, the collection of formulas that are provably equivalent in to a Σ1‐formula or a Π1‐formula is not closed under bounded quantification. Nevertheless, these deficits of are completely repaired by strengthening it to the theory, obtained by using collection rather than replacement in the axiomatization above. These results extend prior work of Zarach. (shrink)

Letκ, λ be regular uncountable cardinals such that λ >κ+is not a successor of a singular cardinal of low cofinality. We construct a generic extension withs = λ starting from a ground model in whicho = λ and prove that assuming ¬0¶,s = λ implies thato ≥ λ in the core model.

We deal with the existence of universal members in a given cardinality for several classes. First, we deal with classes of abelian groups, specifically with the existence of universal members in cardinalities which are strong limit singular of countable cofinality or λ=λℵ0. We use versions of being reduced—replacing Q by a subring —and get quite accurate results for the existence of universals in a cardinal, for embeddings and for pure embeddings. Second, we deal with the oak property, a (...) property of complete first-order theories sufficient for the nonexistence of universal models under suitable cardinal assumptions. Third, we prove that the oak property holds for the class of groups and deals more with the existence of universals. (shrink)

In the previous paper of this volume, Kojman and Shelah solved our long standing problem of collapsing cardinal κ0 to ω1 by the forcing for singular κ with countable cofinality. The aim of the present paper is to give an explicit construction of the Boolean matrix for this collapse.

We improve on results and constructions by Apter, Dimitriou, Gitik, Hayut, Karagila, and Koepke concerning large cardinals, ultrafilters, and cofinalities without the axiom of choice. In particular, we show the consistency of the following statements from certain assumptions: the first supercompact cardinal can be the first uncountable regular cardinal, all successors of regular cardinals are Ramsey, every sequence of stationary sets in is mutually stationary, an infinitary Chang conjecture holds for the cardinals, and all are singular. In each of (...) the cases, our results either weaken the hypotheses or strengthen the conclusions of known proofs. (shrink)

The 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. In turn, Block II is devoted to the investigation of some problems arising from Singular Cardinal Combinatorics.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^{}$ -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 “ $^{\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 $^{\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 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 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. (shrink)

In this paper we will prove that ifF is a filter of a free Boolean algebra such that the minimal cardinality of the set of generators ofF is an uncountable regular cardinal or a singular cardinal with uncountable cofinality thenF is freely generated.

We address three questions raised by Cummings and Foreman regarding a model of Gitik and Sharon. We first analyze the PCF-theoretic structure of the Gitik–Sharon model, determining the extent of good and bad scales. We then classify the bad points of the bad scales existing in both the Gitik–Sharon model and other models containing bad scales. Finally, we investigate the ideal of subsets of singular cardinals of countable cofinality carrying good scales.

We prove consistent, assuming there is a supercompact cardinal, that there is a singular strong limit cardinal $\mu$ , of cofinality $\omega$ , such that every $\mu^{+}$ -chromatic graph X on $\mu^{+}$ has an edge colouring c of X into $\mu$ colours for which every vertex colouring g of X into at most $\mu$ many colours has a g-colour class on which c takes every value. The paper also contains some generalisations of the above statement in which $\mu^{+}$ (...) is replaced by other cardinals < $\mu$. (shrink)

We extend some results of Adam Kolany to show that large sets of satisfiable sentences generally contain equally large subsets of mutually consistent sentences. In particular, this is always true for sets of uncountable cofinality, and remains true for sets of denumerable cofinality if we put appropriate bounding conditions on the sentences. The results apply to both the propositional and the predicate calculus. To obtain these results, we use delta sets for regular cardinals, and, for singular cardinals, (...) a generalization of delta sets. All of our results are theorems in ZFC. (shrink)

We obtain an improvement of some coloring theorems from Eisworth :1216–1243, 2010), Eisworth and Shelah :1287–1309, 2009) for the case where the singular cardinal in question has countable cofinality. As a corollary, we obtain an “idealized” version of the combinatorial principle Pr1) that maximizes the indecomposability of the associated ideal.

We develop a method for extending results about ultrafilters into a more general setting. In this paper we shall be mainly concerned with applications to cardinality logics. For example, assumingV=L, Gödel's Axiom of Constructibility, we prove that if λ > ωα then the logic with the quantifier “there existα many” is (λ,λ)-compact if and only if either λ is weakly compact or λ is singular of cofinality<ωα. As a corollary, for every infinite cardinals λ and μ, there exists (...) a (λ,λ)-compact non-(μ,μ)-compact logic if and only if either λ<μ orcfλshrink)

We study the role of meeting numbers in pcf theory. In particular, Shelah's Strong Hypothesis is shown to be equivalent to the assertion that for any singular cardinal σ of cofinality ω, there is a size collection Q of countable subsets of σ with the property that for any infinite subset a of σ, there is a member of Q meeting a in an infinite set.

We prove equiconsistency results concerning gaps between a singular strong limit cardinal κ of cofinality 0 and its power under assumptions that 2κ=κ+δ+1 for δ<κ and some weak form of the Singular Cardinal Hypothesis below κ. Together with the previous results this basically completes the study of consistency strength of the various gaps between such κ and its power under GCH type assumptions below.