Isomorphic spectrum and isomorphic length of a Banach space

We prove that, given any ordinal $\delta < \omega_2$, there exists a transfinite $\delta$-sequence of separable Banach spaces $(X_\alpha)_{\alpha < \delta}$ such that $X_\alpha$ embeds isomorphically into $X_\beta$ and contains no subspace isomorphic to $X_\beta$ for all $\alpha < \beta < \delta$. All these spaces are subspaces of the Banach space $E_p = \bigl( \bigoplus_{n=1}^\infty \ell_p \bigr)_2$, where $1 \leq p < 2$. Moreover, assuming Martin's axiom, we prove the same for all ordinals $\delta$ of continuum cardinality.

On absolutely Baire nonmeasurable functions

We shall show that under Martin’s axiom, there exist absolutely Baire nonmeasurable additive functions. This provides a Baire category counterpart of an analogous measure-theoretic result of A. B. Kharazishvili.

SLOW P-POINT ULTRAFILTERS

We answer a question of Blass, Di Nasso, and Forti [2, 7] by proving, assuming Continuum Hypothesis or Martin’s Axiom, that (1) there exists a P-point which is not interval-to-one and (2) there exists an interval-to-one P-point which is neither quasi-selective nor weakly Ramsey.

Rado’s Conjecture and its Baire version

Rado’s Conjecture is a compactness/reflection principle that says any nonspecial tree of height [Formula: see text] has a nonspecial subtree of size [Formula: see text]. Though incompatible with Martin’s Axiom, Rado’s Conjecture turns out to have many interesting consequences that are also implied by certain forcing axioms. In this paper, we obtain consistency results concerning Rado’s Conjecture and its Baire version. In particular, we show that a fragment of [Formula: see text], which is the forcing axiom for Baire Indestructibly Proper forcings, is compatible with the Baire Rado’s Conjecture. As a corollary, the Baire Rado’s Conjecture does not imply Rado’s Conjecture. Then we discuss the strength and limitations of the Baire Rado’s Conjecture regarding its interaction with stationary reflection principles and some families of weak square principles. Finally, we investigate the influence of Rado’s Conjecture on some polarized partition relations.

Forcing

The method of forcing was introduced by Paul J. Cohen in order to prove the independence of the axiom of choice (AC) from the basic (ZF) axioms of set theory, and of the continuum hypothesis (CH) from the accepted axioms (ZFC = ZF + AC) of set theory (see set theory, axiom of choice, continuum hypothesis). Given a model M of ZF and a certain P∈M, it produces a ‘generic’ G⊆P and a model N of ZF with M⊆N and G∈N. By suitably choosing P, N can be ‘forced’ to be or not be a model of various hypotheses, which are thus shown to be consistent with or independent of the axioms. This method of proving undecidability has been very widely applied. The method has also motivated the proposal of new so-called forcing axioms to decide what is otherwise undecidable, the most important being that called Martin’s axiom (MA).

A note on the Borel types of some small sets

The Borel types of some classical small subsets of the real line are considered. In particular, under Martin’s axiom it is shown that there are at least {{\mathbf{c}}^{+}} pairwise incomparable Borel types of generalized Luzin sets (resp. of generalized Sierpiński sets), where {{\mathbf{c}}} stands for the cardinality of the continuum.