Related papers: Not collapsing cardinals <= kappa in (< kappa) --s…

We prove a revised version of Laver's indestructibility theorem which slightly improves over the classical result. An application yields the consistency of $(\kappa^+,\kappa)\notcc(\aleph\_1,\aleph\_0)$ when $\kappa$ is supercompact. The…

This paper presents the main results in my Ph.D. thesis. In what follows several proofs of SCH are presented introducing a family of covering properties which implies both SCH and the failure of various forms of square. These covering…

Covering matrices were introduced by Viale in his proof that the Singular Cardinals Hypothesis follows from the Proper Forcing Axiom. In the course of his work and in subsequent work with Sharon, he isolated two reflection principles,…

For every uncountable regular $\kappa$, we give two examples of proper posets which turn improper in some $\kappa$-closed forcing extension.

We continue the investigations in the author's book on cardinal arithmetic, assuming some knowledge of it. We deal with the cofinality of (S_{<= aleph_0}(kappa), subseteq) for kappa real valued measurable (Section 3), densities of box…

We investigate whether the ultrafilter number function $\kappa \mapsto \mathfrak{u}(\kappa)$ on the cardinals is monotone, that is, whether $\mathfrak{u}(\lambda) \le \mathfrak{u}(\kappa)$ holds for all cardinals $\lambda < \kappa$ or not.…

We continue [Sh:b, Ch XIII] and [Sh:410]. Let W be an inner model of ZFC. Let kappa be a cardinal in V. We say that kappa-covering holds between V and W iff for all X in V with X subseteq ON and V models |X|< kappa, there exists Y in W such…

We consider $(<\lambda)$-support iterations of a version of $(<\lambda)$-strategically complete $\lambda^+$-c.c. definable forcing notions along partial orders. We show that such iterations can be corrected to yield an analog of a result by…

This article continues Roslanowski and Shelah math.LO/9906024 and 1105.6049 We introduce here yet another property of (<lambda)-strategically complete forcing notions which implies that their lambda-support iterations do not collapse…

This paper deals with variety of problems in pcf theory and infinitary combinatorics. We look at normal filters and prc, measures of the size of [lambda]^{<kappa}, pcf-inaccessibility, entangled orders (and narrow Boolean Algebras),…

We succeed to say something on the identities of (mu^+, mu) when mu>theta>cf(mu), mu strong limit theta--compact. This hopefully will help to prove the consistency of ``some pair (mu^+,mu) is not compact'', however, this has not been…

Let $\kappa$ be any regular cardinal. Assuming the existence of a huge cardinal above $\kappa$, we prove the consistency of $\binom{\kappa^{++}}{\kappa^+}\rightarrow\binom{\tau}{\kappa^+}$ for every ordinal $\tau<\kappa^{++}$. Likewise, we…

The purpose of this paper is to present some results which suggest that the Singular Cardinals Hypothesis follows from the Proper Forcing Axiom. What will be proved is that a form of simultaneous reflection follows from the Set Mapping…

We demonstrate that the technology of Radin forcing can be used to transfer compactness properties at a weakly inaccessible but not strong limit cardinal to a strongly inaccessible cardinal. As an application, relative to the existence of…

We study the general problem of the behaviour of the continuum function in the presence of non-supercompact strongly compact cardinals.

We study the nonstationary-support iteration of Prikry forcings below a measurable cardinal \kappa, characterizing all the normal measures it carries in the generic extension. We then analyze the restriction of ultrapower embeddings, taken…

Assuming the existence of a supercompact cardinal, we construct a model where, for some uncountable regular cardinal $\kappa$, there are no $\Sigma^1_1(\kappa)-\kappa-$mad families.

We prove forcing axiom equivalents of two families of weakenings of the axiom of choice: a trichotomy principle for cardinals isolated by L\'evy, ${\rm H\hskip0.05pt}_\kappa$, and ${\rm DC}_\kappa$, the principle of dependent choices…

We prove an iteration theorem which guarantees for a wide class of nice iterations of $\omega_1$-preserving forcings that $\omega_1$ is not collapse, at the price of needing large cardinals to burn as fuel. More precisely, we show that a…

This is an expository paper about several sophisticated forcing techniques closely related to standard finite support iterations of ccc partial orders. We focus on the four topics of ultrapowers of forcing notions, iterations along…