Related papers: Anatomy of $\tilde{\mathbb{E}}$

We obtain a complete characterization of \emph{topologically exact patterns} on \emph{triods}. Based on their \emph{rotation number} $\rho$, these \emph{exact patterns} are grouped into three classes: \emph{slow} ($\rho < \frac{1}{3}$),…

Let $M$ be a transitive model of $ZFC$ and let ${\bf B}$ be a $M$-complete Boolean algebra in $M.$ (In general a proper class.) We define a generalized notion of forcing with such Boolean algebras, $^*$forcing. (A $^*$ forcing extension of…

It was realized early on that topologies can model constructive systems, as the open sets form a Heyting algebra. After the development of forcing, in the form of Boolean-valued models, it became clear that, just as over ZF any…

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the…

I introduce a new family of axioms extending ZFC set theory, the $\Sigma_n$-correct forcing axioms. These assert roughly that whenever a forcing name $\dot{a}$ can be forced by a poset in some forcing class $\Gamma$ to have some $\Sigma_n$…

We continue the research of an extension $\widetilde{\mid}$ of the divisibility relation to the Stone-\v Cech compactification $\beta N$. First we prove that ultrafilters we call prime actually possess the algebraic property of primality.…

An $\aleph_1$-Souslin tree is a complicated combinatorial object whose existence cannot be decided on the grounds of ZFC alone. But 15 years after Tennenbaum and independently Jech devised notions of forcing for introducing such a tree,…

The aim of these lectures is to give a short introduction to forcing. We will avoid metamathematical issues as much as possible and similarly we will avoid performing the actual construction of forcing. We assume familiarity with basic…

In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…

Topological Ramsey spaces are spaces which support infinite dimensional Ramsey theory similarly to the Ellentuck space. Each topological Ramsey space is endowed with a partial ordering which can be modified to a $\sigma$-closed `almost…

Henle, Mathias, and Woodin proved that, provided that $\omega\rightarrow(\omega)^{\omega}$ holds in a model $M$ of ZF, then forcing with $([\omega]^{\omega},\subseteq^*)$ over $M$ adds no new sets of ordinals, thus earning the name a…

We prove some iteration theorems for a certain class of $\kappa^+$-cc forcing posets.

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

We show, assuming a mild set-theoretic hypothesis, that if an abstract elementary class (AEC) has a superstable-like forking notion for models of cardinality $\lambda$ and a superstable-like forking notion for models of cardinality…

We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…

We investigate the local topological structure of non-metrizable topological groups through the lens of Tukey order and cofinal types. Motivated by recent advances in topological groups admitting an $\omega^\omega$-base, we introduce the…

We develop a new method for building forcing iterations with symmetric systems of structures as side conditions. Using our method we prove that the forcing axiom for the class of all the small finitely proper posets is compatible with a…

We discuss some highlights of our computer-verified proof of the construction, given a countable transitive set-model $M$ of $\mathit{ZFC}$, of generic extensions satisfying $\mathit{ZFC}+\neg\mathit{CH}$ and $\mathit{ZFC}+\mathit{CH}$.…

The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…