Order-computable sets
From MaRDI portal
Publication:2469429
DOI10.1305/ndjfl/1187031407zbMath1146.03030OpenAlexW2167890881MaRDI QIDQ2469429
Denis R. Hirschfeldt, Sergei Podzorov, Russell G. Miller
Publication date: 5 February 2008
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1187031407
computable structurecomputably enumerable setErshov's hierarchycomputable orderlimit computable setorder-computable set
Recursively (computably) enumerable sets and degrees (03D25) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)
Related Items
Effectively categorical abelian groups ⋮ On limitwise monotonicity and maximal block functions ⋮ Iterated effective embeddings of abelian p-groups ⋮ Metric structures and probabilistic computation ⋮ Limitwise monotonic functions, sets, and degrees on computable domains ⋮ Limitwise monotonic sequences and degree spectra of structures ⋮ η-representation of sets and degrees
This page was built for publication: Order-computable sets