Enumeration reducibilities

DOI10.1007/BF00967201zbMath0409.03026OpenAlexW4246897123MaRDI QIDQ1258734

E. A. Polyakov, M. G. Rozinas

Publication date: 1978

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00967201

zbMATH Keywords

Enumeration Reducibility

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

Duality, non-standard elements, and dynamic properties of r.e. sets, Strong enumeration reducibilities, Bounded query classes and the difference hierarchy, Bounded enumeration reducibility and its degree structure

Cites Work

• Unnamed Item
• Enumeration reducibility and partial degrees
• [https://portal.mardi4nfdi.de/wiki/Publication:5668461 A Minimal Partial Degree ≦0 �]