Model-theoretic properties of the n-c.e. degrees

DOI10.1093/LOGCOM/EXQ034zbMath1254.03079OpenAlexW1979016908WikidataQ128145816 ScholiaQ128145816MaRDI QIDQ2907047

Marat M. Arslanov

Publication date: 5 September 2012

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

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

zbMATH Keywords

survey paperembeddabilitydefinabilityTuring reducibilityelementary equivalencecountable categoricitydifference hierarchyErshov hierarchy\(n\)-c.e. degrees\(n\)-c.e. sets\(\Sigma ^{0}_{1}\)-substructures

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28) Hierarchies of computability and definability (03D55)

This page was built for publication: Model-theoretic properties of the n-c.e. degrees