ON REDUCIBILITIES OF NUMERATIONS

DOI10.1070/SM1981V040N02ABEH001797zbMath0465.03025OpenAlexW1976553816MaRDI QIDQ3916565

A. N. Degtev

Publication date: 1981

Published in: Mathematics of the USSR-Sbornik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/sm1981v040n02abeh001797

zbMATH Keywords

computable numerations

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Related Items (2)

On \(p \)-universal and \(p \)-minimal numberings ⋮ Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets

This page was built for publication: ON REDUCIBILITIES OF NUMERATIONS