zbMATH — the first resource for mathematics

On computable minimal enumerations. (English) Zbl 0852.03020
Ershov, Y. (ed.) et al., Algebra. Proceedings of the third international conference on algebra, Krasnoyarsk, Russia, August 23-28, 1993. Berlin: Walter de Gruyter. 21-33 (1996).
Let \({\mathcal A}\) be a class of enumerable sets. A surjection \(\alpha: \mathbb{N}\to {\mathcal A}\) is called an enumeration of \({\mathcal A}\). Computable enumerations of classes of enumerable sets is a well-studied area of classical computability theory and is particularly relevant to effective model theory. The paper at hand surveys a number of important results and questions in this area.
For the entire collection see [Zbl 0836.00025].
03D45 Theory of numerations, effectively presented structures
03D25 Recursively (computably) enumerable sets and degrees