On computable enumerations. II

DOI10.1007/BF02219821zbMath0273.02025MaRDI QIDQ2264760

I. A. Lavrov, Yuri L. Ershov

Publication date: 1970

Published in: Algebra and Logic (Search for Journal in Brave)

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory (03D99)

Related Items (5)

The d.r.e. degrees are not dense ⋮ Computably enumerable sets and related issues ⋮ Some effectively infinite classes of enumerations ⋮ Index sets in 0' ⋮ Computable enumerations of families of general recursive functions

Cites Work

• A stronger form of a theorem of Friedberg
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

This page was built for publication: On computable enumerations. II