A hierarchy of classes of families and \(n\)-low degrees

DOI10.1007/s10469-015-9355-4zbMath1361.03040OpenAlexW2339760412MaRDI QIDQ904326

M. Kh. Faizrakhmanov, Iskander Sh. Kalimullin

Publication date: 13 January 2016

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

Full work available at URL: https://doi.org/10.1007/s10469-015-9355-4

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28) Hierarchies of computability and definability (03D55)

Related Items (2)

Universal computable enumerations of finite classes of families of total functions ⋮ Degrees of enumerations of countable Wehner-like families

Cites Work

• Enumerations in computable structure theory
• Enumerations, countable structures and Turing degrees
• A Note on ω-Jump Inversion of Degree Spectra of Structures

This page was built for publication: A hierarchy of classes of families and \(n\)-low degrees