Enumeration Degrees and Enumerability of Familes

DOI10.1093/LOGCOM/EXN032zbMath1169.03030OpenAlexW2009282738MaRDI QIDQ3611726

Iskander Sh. Kalimullin

Publication date: 2 March 2009

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exn032

zbMATH Keywords

enumeration degreesTuring degreesc.e. familiesdegree spectra of modelsenumeration reducible

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (2)

THE TREE OF TUPLES OF A STRUCTURE ⋮ Enumeration Reducibility and Computable Structure Theory

This page was built for publication: Enumeration Degrees and Enumerability of Familes