Related papers: Remarks on countable tightness

We give a combinatorial characterization of countable submaximal subspaces of $2^\kappa$. Using a parametrized version of Mathias forcing, we prove that there exists a countable submaximal subspace of $2^{\omega_1}$ whilst…

Iwasa investigated the preservation of various covering properties of opological spaces under Cohen forcing. By improving the argument in Iwasa's paper, we prove that the Rothberger property, the Menger property and selective screenability…

We construct a model in which the tree property holds in $\aleph_{\omega + 1}$ and it is destructible under $\text{Col}(\omega, \omega_1)$. On the other hand we discuss some cases in which the tree property is indestructible under small or…

We argue that it makes sense to talk about ``typical'' properties of lattices, and then show that there is, up to isomorphism, a unique countable lattice L* (the Fraisse limit of the class of finite lattices) that has all ``typical''…

We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation…

The free topological vector space $V(X)$ over a Tychonoff space $X$ is a pair consisting of a topological vector space $V(X)$ and a continuous map $i=i_{X}: X\rightarrow V(X)$ such that every continuous mapping $f$ from $X$ to a topological…

The following strong form of density of definable types is introduced for theories T admitting a fibered dimension function d: given a model M of T and a definable subset X of M^n, there is a definable type p in X, definable over a code for…

We study the subsets of metric spaces that are negligible for the infimal length of connecting curves; such sets are called metrically removable. In particular, we show that every totally disconnected set with finite Hausdorff measure of…

We define some natural notions of strong and weak Borel Ramsey properties for countable Borel equivalence relations and show that they hold for a countable Borel equivalence relation if and only if the equivalence relation is smooth. We…

The topic of this paper is the subtle interplay between countability and representations. In particular, we establish that the definition of countability of a certain set $X$ crucially hinges on the associated equivalence relation $=_{X}$.…

We show (in ZFC) that the cardinality of a compact homogeneous space of countable tightness is no more than the size of the continuum.

We study the reverse mathematics of the theory of countable second-countable topological spaces, with a focus on compactness. We show that the general theory of such spaces works as expected in the subsystem $\mathsf{ACA}_0$ of second-order…

In this note we prove several theorems that are related to some results and problems from [6]. We answer two of the main problems that were raised in [6]. First we give a ZFC example of a Hausdorff space in $C(\omega_1)$ that has…

We provide a detailed study of two properties of spaces and pairs of spaces, the surjection property and the epsilon-surjection property, that were recently introduced to characterize the notion of computable type arising from computability…

According to mathematical constructivism, a mathematical object can exist only if there is a way to compute (or "construct") it; so, what is non-computable is non-constructive. In the example of the quantum model, whose Fock states are…

A subset $A$ of a topological space $X$ is called relatively functionally countable (RFC) in $X$, if for each continuous function $f : X \to \mathbb{R}$ the set $f[A]$ is countable. We prove that all RFC subsets of a product…

Numerably contractible spaces play an important role in the theory of homotopy pushouts and pullbacks. The corresponding results imply that a number of well known weak homotopy equivalences are genuine ones if numerably contractible spaces…

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

It is well known that the classic {\L}o\'s-Tarski preservation theorem fails in the finite: there are first-order definable classes of finite structures closed under extensions which are not definable (in the finite) in the existential…

We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define…