Related papers: The left side of Cicho\'n's diagram

We use a (countable support) creature construction to show that consistently \[ \mathfrak d=\aleph_1= \text{cov}(\text{NULL}) < \text{non}(\text{MEAGER}) < \text{non}(\text{NULL}) < \text{cof}(\text{NULL}) < 2^{\aleph_0}. \] The same method…

Assuming four strongly compact cardinals, it is consistent that all entries in Cicho\'n's diagram are pairwise different, more specifically that \[ \aleph_1 < \mathrm{add}(\mathrm{null}) < \mathrm{cov}(\mathrm{null}) < \mathfrak{b} <…

We reimplement the creature forcing construction used by Fischer et al. (arXiv:1402.0367) to separate Cicho\'{n}'s diagram into five cardinals as a countable support product. Using the fact that it is of countable support, we augment our…

Let $\mathcal{E}$ denote the $\sigma$-ideal generated by closed null sets on the reals. We show that the uniformity and the covering of $\mathcal{E}$ can be added to Cicho\'n's maximum with distinct values. More specifically, it is…

We show that the evasion number $\mathfrak{e}$ can be added to Cicho\'n's maximum with a distinct value. More specifically, it is consistent that…

Based on the work of Shelah, Kellner, and T\u{a}nasie (Fund. Math., 166(1-2):109-136, 2000 and Comment. Math. Univ. Carolin., 60(1):61-95, 2019), and the recent developments in the third author's master's thesis, we develop a general theory…

It is consistent that \[ \aleph_1 < \mathrm{add}(\mathrm{Null}) < \mathrm{add}(\mathrm{Meager})= \mathfrak{b} < \mathrm{cov}(\mathrm{Null}) < \mathrm{non}(\mathrm{Meager}) < \mathrm{cov}(\mathrm{Meager}) = 2^{\aleph_0}. \] Assuming four…

We introduce a new method for building models of CH, together with $\Pi_2$ statements over $H(\omega_2)$, by forcing. Unlike other forcing constructions in the literature, our construction adds new reals, although only $\aleph_1$-many of…

We use known finite support iteration techniques to present various examples of models where several cardinal characteristics of Cicho\'n's diagram are pairwise different. We show some simple examples forcing the left-hand side of…

This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…

We develop iterated forcing constructions dual to finite support iterations in the sense that they add random reals instead of Cohen reals in limit steps. In view of useful applications we focus in particular on two-dimensional "random"…

We introduce a forcing technique to construct three-dimensional arrays of generic extensions through FS (finite support) iterations of ccc posets, which we refer to as 3D-coherent systems. We use them to produce models of new constellations…

Assuming three strongly compact cardinals, it is consistent that \[ \aleph_1 < \mathrm{add}(\mathrm{null}) < \mathrm{cov}(\mathrm{null}) < \mathfrak{b} < \mathfrak{d} < \mathrm{non}(\mathrm{null}) < \mathrm{cof}(\mathrm{null}) <…

Cicho\'n's diagram describes the connections between combinatorial notions related to measure, category, and compactness of sets of irrational numbers. In the second part of the 2010's, Goldstern, Kellner and Shelah constructed a forcing…

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…

We prove that if there exists a simplified $(\omega_1,2)$-morass, then there is a ccc forcing which adds an $\omega_3$-chain in P($\omega_1$) mod finite and a ccc forcing which adds a family of $\omega_3$-many strongly almost disjoint…

Using matrix iterations of ccc posets, we prove the consistency with ZFC of some cases where the cardinals on the right hand side of Cichon's diagram take two or three arbitrary values (two regular values, the third one with uncountable…

We answer a question of Moore by building a forcing extension satisfying measuring together with CH. The construction works over any model of ZFC and can be described as a forcing iteration with countable structures as side conditions and…

We study the question, what computational power is sufficient to perform constructions using either Laver or Hechler forcing. As a result, we obtain a separation between three relativised non-lowness classes that are the…

Let $(M,\omega)$ be a symplectic manifold, $\mathcal{D}\subset TM$ a real polarization on $M$ and $\wp$ a leaf of $\mathcal{D}$. We construct a Fedosov-type star-product $\ast_L$ on $M$ such that $C^\infty (\wp)[[h]]$ has a natural…