Related papers: Adding many random reals may add many Cohen reals

Let GCH hold and let $j:V\longrightarrow M$ be a definable elementary embedding such that $crit(j)=\kappa$, $^{\kappa}M\subseteq M$ and $\kappa^{++}=\kappa_{M}^{++}$. H. Woodin proved that there is a cofinality preserving generic extension…

We prove that if there are $\mathfrak c$ incomparable selective ultrafilters then, for every infinite cardinal $\kappa$ such that $\kappa^\omega=\kappa$, there exists a group topology on the free Abelian group of cardinality $\kappa$…

Assuming the existence of a proper class of supercompact cardinals, we force that for every regular cardinal $\kappa$, there are $\kappa^+$-Aronszajn trees and all such trees are special.

Let $\mathcal{SN}$ be the $\sigma$-ideal of the strong measure zero sets of reals. We present general properties of forcing notions that allow to control of the additivity of $\mathcal{SN}$ after finite support iterations. This is applied…

Let $\kappa$,$\lambda$ be regular uncountable cardinals such that $\lambda > \kappa^+$ is not a successor of a singular cardinal of low cofinality. We construct a generic extension with $s(\kappa) = \lambda$ starting from a ground model in…

We develop a version of Cichon's diagram for cardinal invariants on the generalized Cantor space 2^kappa or the generalized Baire space kappa^kappa where kappa is an uncountable regular cardinal. For strongly inaccessible kappa, many of the…

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…

Assuming an instance of the Brodsky-Rinot proxy principle holding at a regular uncountable cardinal $\kappa$, we construct $2^\kappa$-many pairwise non-embeddable minimal non-$\sigma$-scattered linear orders of size $\kappa$. In particular,…

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.…

Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…

We prove that consistently there is a singular cardinal $\kappa$ of uncountable cofinality such that $2^\kappa$ is weakly inaccessible, and every regular cardinal strictly between $\kappa$ and $2^\kappa$ is the character of some uniform…

We consider the partition lattice $\Pi_\kappa$ on any set of transfinite cardinality $\kappa$ and properties of $\Pi_\kappa$ whose analogues do not hold for finite cardinalities. Assuming the Axiom of Choice we prove: (I) the cardinality of…

We introduce a method of constructing a forcing along a simplified $(\kappa,1)$-morass such that the forcing satisfies the $\kappa$-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain…

All spaces are assumed to be Tychonoff. Given a realcompact space $X$, we denote by $\mathsf{Exp}(X)$ the smallest infinite cardinal $\kappa$ such that $X$ is homeomorphic to a closed subspace of $\mathbb{R}^\kappa$. Our main result shows…

We investigate regularity properties derived from tree-like forcing notions in the setting of "generalized descriptive set theory", i.e., descriptive set theory on $\kappa^\kappa$ and $2^\kappa$, for regular uncountable cardinals $\kappa$.

We show that generalized eventually narrow sequences on a strongly inaccessible cardinal $\kappa$ are preserved under the Cummings-Shaleh non-linear iterations of the higher Hechler forcing on $\kappa$. Moreover assuming GCH,…

We use Shelah's theory of possible cofinalities in order to solve a problem about ultrafilters. THEOREM. Suppose that $ \lambda $ is a singular cardinal, $ \lambda ' < \lambda $, and the ultrafilter $D$ is $ \kappa $-decomposable for all…

Let $\Gamma^\infty$ be the set of all universally Baire sets of reals. Inspired by recent work of the second author and Nam Trang, we introduce a new technique for establishing generic absoluteness results for models containing…

We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).

Providing explanations about how machine learning algorithms work and/or make particular predictions is one of the main tools that can be used to improve their trusworthiness, fairness and robustness. Among the most intuitive type of…