相关论文: Hechler's theorem for the null ideal

The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…

For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…

This article concerns the Herrlich-Chew theorem stating that a Hausdorff zero-dimensional space is $\mathbb{N}$-compact if and only if every clopen ultrafilter with the countable intersection property in this space is fixed. It also…

A notion of partial ideal for an operator algebra is a weakening the notion of ideal where the defining algebraic conditions are enforced only in the commutative subalgebras. We show that, in a von Neumann algebra, the ultraweakly closed…

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

Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…

This is an introduction to the set-theoretic method of forcing, including its application in proving the independence of the Continuum Hypothesis from the Zermelo-Fraenkel axioms of set theory. I presuppose no particular mathematical…

Let $\mathcal{N}$ be the $\sigma$-ideal of the null sets of reals. We introduce a new property of forcing notions that enable control of the additivity of $\mathcal{N}$ after finite support iterations. This is applied to answer some open…

We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…

We give results exploring the relationship between dominating and unbounded reals in Hechler extensions, as well as the relationships among the extensions themselves. We show that in the standard Hechler extension there is an unbounded real…

A $\sigma$-ideal $\cal{I}$ on a set $X$ is supersaturated if for every family $\cal{F}$ of $\cal{I}$-positive sets with $|\cal{F}| < \mathrm{add}(\cal{I})$, there exists a countable set that meets every set in $\cal{F}$. We show that many…

We prove when a Banach ideal of linear operators defined, or characterized, by the transformation of vector-valued sequences is maximal. Known results are recovered as particular cases and new information is obtained. To accomplish this…

It is proved that every normalized weakly null \sq\ has a sub\sq\ which is convexly unconditional. Further, an Hierarchy of summability methods is introduced and with this we give a complete classification of the complexity of weakly null…

We develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…

Generalized Higman's Theorem is the direct counterpart of Higman's Theorem that asserts the closure of the class of \emph{better} quasi-orders, instead of the class of \emph{well} quasi-orders, under the construction $P\mapsto P^{<\omega}$…

A forcing set for a perfect matching of a graph is defined as a subset of the edges of that perfect matching such that there exists a unique perfect matching containing it. A complete forcing set for a graph is a subset of its edges, such…

The main goal of this note is to prove the following theorem. If $A_n$ is a sequence of measurable sets in a $\sigma$-finite measure space $(X, \mathcal{A}, \mu)$ that covers $\mu$-a.e. $x \in X$ infinitely many times, then there exists a…

This is an overview about a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along $\omega_1$ is given. Then its direct limit satisfies ccc by…

For a given ring (domain) in $\overline{\mathbb{R}}^n$ we discuss whether its boundary components can be separated by an annular ring with modulus nearly equal to that of the given ring. In particular, we show that, for all $n\ge 3\,,$ the…

The concept of zero forcing is extended from graphs to uniform hypergraphs in analogy with the way zero forcing was defined as an upper bound for the maximum nullity of the family of symmetric matrices whose nonzero pattern of entries is…