Related papers: Classifying equivalence relations in the Ershov hi…

A general theme of computable structure theory is to investigate when structures have copies of a given complexity $\Gamma$. We discuss such problem for the case of equivalence structures and preorders. We show that there is a $\Pi^0_1$…

We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…

We consider reducibility of equivalence relations (ERs, for brevity), in a nonstandard domain, in terms of the Borel reducibility and the countably determined (CD, for brevity) reducibility. This reveals phenomena partially analogous to…

We define a hierarchy of systems with topological completely positive entropy in the context of continuous countable amenable group actions on compact metric spaces. For each countable ordinal we construct a dynamical system on the…

We consider equivalence relations and preorders complete for various levels of the arithmetical hierarchy under computable, component-wise reducibility. We show that implication in first order logic is a complete preorder for $\SI 1$, the…

In this survey we discuss work of Levin and V'yugin on collections of sequences that are non-negligible in the sense that they can be computed by a probabilistic algorithm with positive probability. More precisely, Levin and V'yugin…

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…

We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…

Let $S$ be a unital associative ring and $S[t;\sigma,\delta]$ be a skew polynomial ring, where $\sigma$ is an injective endomorphism of $S$ and $\delta$ a left $\sigma$-derivation. For each $f\in S[t;\sigma,\delta]$ of degree $m>1$ with a…

We consider the arithmetic complexity of index sets of uniformly computably enumerable families learnable under different learning criteria. We determine the exact complexity of these sets for the standard notions of finite learning,…

We ask whether $\mathbf{\Delta^1_2}$ or $\mathbf{\Sigma^1_2}$ equivalence relations with $I$-small classes for $I$ a $\sigma$-ideal must have perfectly many classes. We show that for a wide class of ccc $\sigma$-ideals, a positive answer…

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…

A class of relational databases has low degree if for all $\delta>0$, all but finitely many databases in the class have degree at most $n^{\delta}$, where $n$ is the size of the database. Typical examples are databases of bounded degree or…

We continue the investigation of tabular algebras with trace (a certain class of associative ${\Bbb Z}[v, v^{-1}]$-algebras equipped with distinguished bases) by determining the extent to which the tabular structure may be recovered from a…

We establish the decidability of the $\Sigma_2$ theory of both the arithmetic and hyperarithmetic degrees in the language of uppersemilattices i.e. the language with $\leq, 0$ and $\sqcup$. This is achieved by using Kumabe-Slaman forcing -…

We show that unital simple C*-algebras with tracial topological rank zero which are locally approximated by subhomogeneous C^-algebras can be classified by their ordered $K$-theory. We apply this classification result to show that certain…

We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree…

We determine some of the derived equivalences of a class of gentle algebras called surface algebras. These algebras are constructed from an unpunctured Riemann surface of genus 0 with boundary and marked points by introducing cuts in…

The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…

A measurable relation algebra is a relation algebra in which the identity element is a sum of atoms that can be measured in the sense that the "size" of each such atom can be defined in an intuitive and reasonable way (within the framework…