Related papers: Computability of Separation Axioms in Countable Se…

We introduce the property of countable separation for a locally convex Hausdorff space $X$ and relate it to the existence of a metrizable coarser topology. Building on this, we demonstrate how the separability of $X$ is equivalent to the…

For infinite products of compact spaces, Tychonoff's theorem asserts that their product is compact, in the product topology. Tychonoff's theorem is shown to be equivalent to the axiom of choice. In this paper, we show that any countable…

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…

The enumeration degrees of sets of natural numbers can be identified with the degrees of difficulty of enumerating neighborhood bases of points in a universal second-countable $T_0$-space (e.g. the $\omega$-power of the Sierpi\'nski space).…

We first show that in the function realizability topos every metric space is separable, and every object with decidable equality is countable. More generally, working with synthetic topology, every $T_0$-space is separable and every…

We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. (T.1) A basic property of Cantor space $2^{\mathbb{N}}$…

The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…

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…

A rank is a notion in descriptive set theory that describes ranks such as the Cantor-Bendixson rank on the set of closed subsets of a Polish space, differentiability ranks on the set of differentiable functions in $C[0,1]$ such as the…

In a recent paper, two multi-representations for the measurable sets in a computable measure space have been introduced, which prove to be topologically complete w.r.t. certain topological properties. In this contribution, we show them…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…

We study the completeness and ultracompleteness numbers of a convergence space. In the case of a completely regular topological space, the completeness number is countable if and only if the space is $\v{C}$ech-complete, and the…

we prove that if $X$ is a locally compact $\sigma$-compact space then on its quotient, $\gamma(X)$ say, determined by the algebra of all real valued bounded continuous functions on $X$, the quotient topology and the completely regular…

In this paper we continue to study the property of separability of functional space C(X) with the open-point and bi-point-open topologies.

We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…

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…

A topological space is almost locally compact if it contains a dense locally compact subspace. We generalize a result from \cite{Ma}, showing that isomorphism on Borel classes of almost locally compact Polish metric structures is always…

We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…

We reprove the countable splitting lemma by adapting Nawrotzki's algorithm which produces a sequence that converges to a solution. Our algorithm combines Nawrotzki's approach with taking finite cuts. It is constructive in the sense that…