Related papers: A non-computable c.e. closed subset of $[0,1]$
Hyperspaces $\mathcal H(X)$ of all countable compact subsets of a metric space $X$ and $\mathcal A_n(X)$ of infinite compact subsets which have at most $n$ ($n\in\mathbb N$), or finitely many ($n=\omega$) or countably many ($n=\omega+1$)…
For a compact space $K$ we denote by $C_w(K)$ ($C_p(K)$) the space of continuous real-valued functions on $K$ endowed with the weak (pointwise) topology. In this paper we discuss the following basic question which seems to be open: Let $K$…
We prove that the category of c-spaces with continuous maps is not cartesian closed. As a corollary the category of locally finitary compact spaces with continuous maps is also not cartesian closed.
We determine the exact complexity of classifying compact metric spaces up to homeomorphism. More precisely, the homeomorphism relation on compact metric spaces is Borel bi-reducible with the complete orbit equivalence relation of Polish…
A computable graph $\mathcal{G}$ is computably categorical relative to a degree $\mathbf{d}$ if and only if for all $\mathbf{d}$-computable copies $\mathcal{B}$ of $\mathcal{G}$, there is a $\mathbf{d}$-computable isomorphism…
In this paper, we prove that given any \Pi^0_1 subset $P$ of $\{0,1\}^\NN$ there is a tileset $\tau$ with a set of configurations $C$ such that $P\times\ZZ^2$ is recursively homeomorphic to $C\setminus U$ where $U$ is a computable set of…
An $\omega_1$-compact space is a space in which every closed discrete subspace is countable. We give various general conditions under which a locally compact, $\omega_1$-compact space is $\sigma$-countably compact, i.e., the union of…
The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…
In his PhD Thesis Konstantinos Beros proved a number of results about compactly generated subgroups of Polish groups. Such a group is K-sigma - the countable union of compact sets. He notes that the group of rationals under addition with…
We will see how to define the metric $\beta$, which turns the topological space of continuous functions whose domains are open subsets of a locally compact and second countable space $X$ to values in a polish space $Y$, called…
A computable structure $\mathcal{A}$ is decidable if, given a formula $\varphi(\bar{x})$ of elementary first-order logic, and a tuple $\bar{a} \in \mathcal{A}$, we have a decision procedure to decide whether $\varphi$ holds of $\bar{a}$. We…
We provide examples of nonseparable compact spaces with the property that any continuous image which is homeomorphic to a finite product of spaces has a maximal prescribed number of nonseparable factors.
For $r \in [0,1]$ we say that a set $A \subseteq \omega$ is \emph{coarsely computable at density} $r$ if there is a computable set $C$ such that $\{n : C(n) = A(n)\}$ has lower density at least $r$. Let $\gamma(A) = \sup \{r : A \hbox{ is…
In this paper we develop general techniques for classes of computable real numbers generated by subsets of total computable (recursive functions) with special restrictions on basic operations in order to investigate the following problems:…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
Motivated by importance of operator spaces contained in the set of all scalar multiples of isometries ($MI$-spaces) in a separable Hilbert space for $C^*$-algebras and E-semigroups we exhibit more properties of such spaces. For example, if…
Given a compact Polish space $E$ and the hyperspace of its compact subsets $\mathcal{K}(E)$, we consider the class of $G_{\delta}$ $\sigma$-ideals of compact subsets of $E$ that can be represented via a compact subset of $\mathcal{K}(E)$.…
The approximation of natural numbers subsets has always been one of the fundamental issues in computability theory. Computable approximation, $\Delta_2$-approximation, as well as introducing the generically computable sets have been some…
Our focus will be on the computably enumerable (c.e.) sets and trivial, non-trivial, Friedberg, and non-Friedberg splits of the c.e. sets. Every non-computable set has a non-trivial Friedberg split. Moreover, this theorem is uniform. V. Yu.…
We work with the structure consisting of all computably enumerable (c.e.) sets ordered by set inclusion. The question we will partially address is which c.e.\ sets are autormorphic to low (or low$_2$ sets. Using work of Miller, we can see…