Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Turing and enumeration jumps in the Ershov hierarchy

From MaRDI portal
Publication:2907052
Jump to:navigation, search

DOI10.1093/LOGCOM/EXQ039zbMath1253.03070OpenAlexW2165448603MaRDI QIDQ2907052

M. Kh. Fajzrakhmanov, Iskander Sh. Kalimullin

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/exq039


zbMATH Keywords

reducibilityErshov hierarchyenumeration jump


Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55)


Related Items (2)

A classification of low c.e. sets and the Ershov hierarchy ⋮ Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy







This page was built for publication: Turing and enumeration jumps in the Ershov hierarchy

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2907052&oldid=15871048"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 20:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki