On the public citation graph

Ershov hierarchy

https://doi.org/10.1007/bf00968968
0 signed · 17 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0090937openalex-snapshot
Hierarchies of sets and degrees below 0′
inferredcites →https://doi.org/10.1090/s0273-0979-1981-14863-1openalex-snapshot
Strong reducibilities

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.200710011openalex-snapshot
Hierarchies of Δ02‐measurable k ‐partitions
inferred← citeshttps://doi.org/10.1002/malq.202400024openalex-snapshot
Wadge degrees of Δ20$\mathbf{\Delta }^0_2$ omega‐powers
inferred← citeshttps://doi.org/10.1007/bf01158273openalex-snapshot
Jumps of certain classes of ?2 0-sets
inferred← citeshttps://doi.org/10.1007/bf01370692openalex-snapshot
The density of the low2 n-r.e. degrees
inferred← citeshttps://doi.org/10.1007/bf01978401openalex-snapshot
Ershov hierarchy and the t-jump
inferred← citeshttps://doi.org/10.1007/s00153-020-00710-1openalex-snapshot
Classifying equivalence relations in the Ershov hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-018-9495-4openalex-snapshot
Turing Degrees in Refinements of the Arithmetical Hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-019-09538-yopenalex-snapshot
Weakly Precomplete Equivalence Relations in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-025-09780-7openalex-snapshot
CEA-Operators and the Ershov Hierarchy. I
inferred← citeshttps://doi.org/10.1007/s10469-025-09788-zopenalex-snapshot
CEA-Operators and the Ershov Hierarchy. II
inferred← citeshttps://doi.org/10.1007/s10958-021-05422-2openalex-snapshot
Precomplete Numberings
inferred← citeshttps://doi.org/10.1016/j.apal.2019.102766openalex-snapshot
Turing reducibility in the fine hierarchy
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.022openalex-snapshot
On the Difference Hierarchy in Countably Based T0-Spaces
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.06.031openalex-snapshot
Fine hierarchies and m-reducibilities in theoretical computer science
inferred← citeshttps://doi.org/10.3103/s1066369x21080089openalex-snapshot
CEA Operators and the Ershov Hierarchy
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.