Recursive Structures and Ershov's Hierarchy
From MaRDI portal
Publication:5687409
DOI10.1002/malq.19960420138zbMath0863.03018OpenAlexW1996134179MaRDI QIDQ5687409
Publication date: 27 May 1997
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19960420138
difference hierarchyErshov's hierarchyrecursive structuresintrinsically \(\alpha\)-r.e.intrinsically r.e. relations
Computable structure theory, computable model theory (03C57) Hierarchies of computability and definability (03D55)
Related Items
The Hausdorff-Ershov hierarchy in Euclidean spaces ⋮ Program Size Complexity of Correction Grammars in the Ershov Hierarchy ⋮ Degree Spectra of Relations on a Cone ⋮ Resource restricted computability theoretic learning: Illustrative topics and problems ⋮ Learning correction grammars ⋮ Rice and Rice-Shapiro Theorems for transfinite correction grammars ⋮ Turing degrees of certain isomorphic images of computable relations
Cites Work
This page was built for publication: Recursive Structures and Ershov's Hierarchy