Related papers: Remarks on countable tightness

Inspired by a recent work of Dias and Tall, we show that a compact indestructible space is sequentially compact. We also prove that a Lindelof Hausdorff indestructible space has the finite derived set property and a compact Hausdorff…

In this survey, my aim has been to discuss the use of sequences and countable sets in general topology. In this way I have been led to consider five different classes of topological spaces: first countable spaces, sequential spaces, Frechet…

We show that there is a compact topological space carrying a measure which is not a weak* limit of finitely supported measures but is in the sequential closure of the set of such measures. We construct compact spaces with measures of…

In this paper we study the properties of P-generated spaces (by analogy with compactly generated). We prove that a regular Lindel\"of generated space with uncountable dispersion character is resolvable. It is proved that Hausdorff…

We show that all finite powers of a Hausdorff space X do not contain uncountable weakly separated subspaces iff there is a c.c.c poset P such that 1_P forces that ``X is a countable union of 0-dimensional subspaces of countable weight.'' We…

We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…

We study tightness properties and selective versions of separability in bitopological function spaces endowed with set-open topologies.

Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $\Sigma$ of $\mathcal{L}_{\omega_1, \omega}(L)$ for which there exists an $S_\infty$-invariant probability measure on the collection…

We study the difficulty of computing topological entropy of subshifts subjected to mixing restrictions. This problem is well-studied for multidimensional subshifts of finite type : there exists a threshold in the irreducibility rate where…

Modifying the known definition of a Pytkeev network, we introduce a notion of Pytkeev$^*$ network and prove that a topological space has a countable Pytkeev network if and only if $X$ is countably tight and has a countable Pykeev$^*$…

The space of constructible functions form a dense subspace of the space of generalized valuations. In this note we prove a somewhat stronger property that the sequential closure, taken sufficiently many (in fact, infinitely many) times, of…

The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…

We study some variations of the product topology on families of clopen subsets of $2^{\mathbb{N}}\times\mathbb{N}$ in order to construct countable nodec regular spaces (i.e. in which every nowhere dense set is closed) with analytic topology…

Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.

We develop topological dynamics for the group of automorphisms of a monster model of any given theory. In particular, we find strong relationships between objects from topological dynamics (such as the generalized Bohr compactification…

We regard Forcing Notions P adding real numbers and the algebras of P-measurable sets. As for Cohen- and Random-Forcing we can show that each analytic set is P-measurable using Solovay's Unfolding Trick for infinite games. To show this we…

We answer a question of Just, Miller, Scheepers and Szeptycki whether certain diagonalization properties for sequences of open covers are provably closed under taking finite or countable unions. This is a very concise paper. For a…

Lindel\"of spaces are studied in any basic Topology course. However, there are other interesting covering properties with similar behaviour, such as almost Lindel\"of, weakly Lindel\"of, and quasi-Lindel\"of, that have been considered in…

The preservation theorems for semi-properness, hemi-properness, and pseudo-completeness hold for countable support iterations as well as revised countable support iterations, notwithstanding the fact that the "factor lemma" fails for the…

We show that there are uncountably many countable lattices. We give a discussion of which such lattices can be modular or distributive. The method applies to show that certain other classes of structures also have uncountably many…