Some effectively infinite classes of enumerations

DOI10.1016/0168-0072(93)90076-PzbMath0783.03022WikidataQ127976153 ScholiaQ127976153MaRDI QIDQ1210351

Vladimir Yakhnis, Alexander Yakhnis, Sergei S. Goncharov

Publication date: 11 August 1993

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

effective infinity of classes of computable enumerationsenumerations without repetitionsfinite injury priority methodsize of the class of positive elements of a Rogers semilatticeundecidable enumerations

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items (4)

Effectively infinite classes of numberings of computable families of reals ⋮ Effectively infinite classes of numberings and computable families of reals ⋮ On the embedding of the first nonconstructive ordinal in the Rogers semilattices ⋮ A family with a single minimal but not least numbering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unique positive enumeration
• On computable enumerations. II
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Gödel numberings of partial recursive functions
• A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION
• Godel Numberings Versus Friedberg Numberings

This page was built for publication: Some effectively infinite classes of enumerations