Abstract We prove that there exists a $\varSigma ^{0}_{1}$ closed subset of $[0,1]$ which is not homeomorphic to any computably compact space. We show that the index set of c.e. subspaces of $[0,1]$ that admit a computably compact presentation is not arithmetical, as witnessed by subsets of $[0,1]$. The index set result is new for computable Polish spaces in general, not only for those realised as c.e. closed subsets of $[0,1]$.

Abstract The complexity classification of computably enumerable equivalence relations (or ceers, for short) has received much attention in the recent literature. A measure of complexity is typically provided by an appropriate notion of a reduction. Given binary relations $R$ and $S$ on natural numbers, a total function $f$ is a reduction from $R$ to $S$ if for arbitrary $x$ and $y$, the conditions $x~R~y$ and $f(x)~S~f(y)$ are always equivalent. If the function $f$ can be chosen primitive recursive, then we say that $R$ is primitively recursively reducible to $S$, denoted by $R \leq _{pr} S$. We investigate the degree structure $(\textbf {Ceers},\leq _{pr})$ of $\leq _{pr}$-degrees of ceers. We examine when pairs of incomparable degrees have an infimum and a supremum. In particular, we show that $(\textbf {Ceers},\leq _{pr})$ is neither an upper semilattice nor a lower semilattice. We also study first-order definable subclasses of $(\textbf {Ceers},\leq _{pr})$. In particular, we prove that the set of equivalences that have only finitely many classes is definable in $(\textbf {Ceers},\leq _{pr})$. Finally, we show that the structure of $\leq _{pr}$-degrees of computably enumerable preorders has a hereditarily undecidable theory.

Abstract Let $\mathbf{C}^{pr}_{m}$ be the upper semilattice of degrees of computable sets with respect to primitive recursive $m$-reducibility. We prove that the first-order theory of $\mathbf{C}^{pr}_{m}$ is hereditarily undecidable.