×

On nonprincipal enumerations. (English. Russian original) Zbl 0259.02030

Algebra Logic 8(1969), 412-415 (1971); translation from Algebra Logika 8, 726-732 (1969).

MSC:

03D25 Recursively (computably) enumerable sets and degrees
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Yu. L. Ershov, ”On computable enumeration,” Algebra i Logika,7, No. 5, 71–99 (1968).
[2] A. I. Mal’tsev, Algorithms and Recursive Functions [in Russian], Nauka (1965).
[3] A. H. Lachlan, ”A note on universal sets,” J. Symb. Logic,31, No. 4, 573–574 (1966). · Zbl 0239.02021 · doi:10.2307/2269692
[4] A. H. Lachlan, ”Standard classes of recursively-enumerable sets,” Z. Math. Log. Grund. Math.,10, 23–42 (1964). · Zbl 0282.02016 · doi:10.1002/malq.19640100203
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.