The enumeration spectrum hierarchy ofn-families

DOI10.1002/MALQ.201500056zbMath1360.03078OpenAlexW2346004241MaRDI QIDQ2827955

M. Kh. Fajzrakhmanov, Iskander Sh. Kalimullin

Publication date: 24 October 2016

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201500056

zbMATH Keywords

degree spectrum\(n\)-familyenumeration spectrumfinitary \(n\)-family

Mathematics Subject Classification ID

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

Related Items (4)

Universal computable enumerations of finite classes of families of total functions ⋮ Punctual structures and primitive recursive reducibility ⋮ Unnamed Item ⋮ Degrees of enumerations of countable Wehner-like families

Cites Work

• Reducibility on families
• Enumerations in computable structure theory
• THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES
• Enumerations, countable structures and Turing degrees
• Effective properties of Marker's extensions

This page was built for publication: The enumeration spectrum hierarchy ofn-families