Related papers: Remarks on countable tightness
We work in set-theory without choice ZF. Denoting by AC(N) the countable axiom of choice, we show in ZF+AC(N) that the closed unit ball of a uniformly convex Banach space is compact in the convex topology (an alternative to the weak…
We show in ZF that: (i) Every subcompact metrizable space is completely metrizable, and every completely metrizable space is countably subcompact. (ii) A metrizable space X=(X,T) is countably compact iff it is countably subcompact relative…
We describe the countable ordinals in terms of iterations of Mostowski collapsings. This gives a proof-theoretic bound of definable countable ordinals in the Zermelo-Fraenkel's set theory ZF.
We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…
After small forcing, any < kappa-closed forcing will destroy the supercompactness, even the strong compactness, of kappa .
We introduce a forcing that adds a $\square(\aleph_2,\aleph_0)$-sequence with countable conditions under CH. Assuming the consistency of a weakly compact cardinal, we can find a forcing extension by our new poset in which both…
For every uncountable regular $\kappa$, we give two examples of proper posets which turn improper in some $\kappa$-closed forcing extension.
We make use of a finite support product of Jensen forcing to define a model in which there is a countable non-empty lightface $\Pi^1_2$ set of reals containing no ordinal-definable real.
Relationships between a chaotic behavior and closely related properties of topological transitivity, sensitivity to initial conditions, density of closed orbits of homeomorphism groups and their countable products are investigated. We…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
Compactness is one of the core notions of analysis: it connects local properties to global ones and makes limits well-behaved. We study the computational properties of the compactness of Cantor space $2^{\mathbb{N}}$ for uncountable covers.…
The set of integer number lists with finite length, and the set of binary trees with integer labels are both countably infinite. Many inductively defined types also have countably many elements. In this paper, we formalize the syntax of…
It is shown that CH implies the existence of a compact Hausdorff space that is countable dense homogeneous, crowded and does not contain topological copies of the Cantor set. This contrasts with a previous result by the author which says…
We answer a question of Moore by building a forcing extension satisfying measuring together with CH. The construction works over any model of ZFC and can be described as a forcing iteration with countable structures as side conditions and…
We investigate the statement "the order topology of every countable complete linear order is compact" in the framework of reverse mathematics, and we find that the statement's strength depends on the precise formulation of compactness. If…
In this paper we consider the problem of characterization of topological spaces that embed into countably compact Hausdorff spaces. We study the separation axioms of subspaces of countably compact Hausdorff spaces and construct an example…
We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
I prove preservation theorems for countable support iteration of proper forcing concerning certain classes of capacities and submeasures. New examples of forcing notions and connections with measure theory are included.
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…