Autor:	V. L. Selivanov
Rok vydání:	1985
Předmět:	Algebra Class (set theory) Hierarchy Recursively enumerable language General Mathematics Analytical hierarchy Arithmetical hierarchy Mathematics
Zdroj:	Siberian Mathematical Journal. 25:474-488
ISSN:	1573-9260 0037-4466
DOI:	10.1007/bf00968988
Popis:	In [I] the problem about the possibility of "structural" discription of the families of recursively enumerable sets, whose index sets belong to a given class of the arithmetical hierarchy, is posed. In this article, we will study the possibility of this description in terms of completely enumerable families, and that too in the following more general situation: for abstract classes of numbered sets and for various hierarchies.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::5bd0eae819c95130ee746719a3615738 https://doi.org/10.1007/bf00968988 Zobrazit plný text záznamu Full text from SpringerLink