No label defined (Q4249359)

This is a survey on results on computable classes of algebraic systems. A class of constructive models \(K\) is called computable if it possesses a computable indexing, i.e., if there exists a computable sequence of computable models \((M_i)_{i<\omega}\) such that each of its members has a computably isomorphic copy in the class \(K\) and each member of \(K\) has a computably isomorphic copy among the \(M_i\)'s. The author discusses the results on index sets of computable indexings, algorithmic reducibilities of computable indexings, semilattices of computable indexings, and other related problems for abstract classes of systems as well as for classical families of models such as Abelian groups, Boolean algebras, etc. For the entire collection see [Zbl 0905.03001].