Two existence theorems for computable numerations

DOI10.1007/BF02306734zbMath0298.02034MaRDI QIDQ1214405

A. B. Hutoreckii

Publication date: 1971

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (6)

Minimal generalized computable numberings and families of positive preorders ⋮ Ideals without minimal elements in Rogers semilattices ⋮ On universal pairs in the Ershov hierarchy ⋮ The Rogers semilattices of generalized computable enumerations ⋮ Friedberg numberings of families of partial computable functionals ⋮ Rogers semilattices for families of equivalence relations in the Ershov hierarchy

Cites Work

• Unnamed Item
• Three theorems on the degrees of recursively enumerable sets
• Degrees of Unsolvability. (AM-55)
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability

This page was built for publication: Two existence theorems for computable numerations