On the public citation graph

Hierearchies of hyperarithmetical sets and functions

https://doi.org/10.1007/bf01978879
0 signed · 31 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/bf01980638openalex-snapshot
Structure of powers of generalized index sets
inferredcites →https://doi.org/10.1007/bfb0090937openalex-snapshot
Hierarchies of sets and degrees below 0′
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-36494-3_10openalex-snapshot
Wadge Degrees of ω-Languages of Deterministic Turing Machines
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_201openalex-snapshot
Fine hierarchy of regular ω-languages
inferred← citeshttps://doi.org/10.1007/978-1-4615-0755-0_14openalex-snapshot
Positive Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-30229-0_10openalex-snapshot
Well-Quasi Orders and Hierarchy Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-80049-9_40openalex-snapshot
Non-collapse of the Effective Wadge Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-031-36978-0_12openalex-snapshot
Logic vs Topology on Regular $$\omega $$-languages
inferred← citeshttps://doi.org/10.1007/978-3-319-58741-7_36openalex-snapshot
Extending Wadge Theory to k-Partitions
inferred← citeshttps://doi.org/10.1007/bf01978567openalex-snapshot
Index sets of quotient objects of the post numeration
inferred← citeshttps://doi.org/10.1007/bf02001360openalex-snapshot
Index sets of classes of hyper-hypersimple sets
inferred← citeshttps://doi.org/10.1007/bf02018741openalex-snapshot
Fine hierarchy and definable index sets
inferred← citeshttps://doi.org/10.1007/bf02671730openalex-snapshot
Refining the polynomial hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-007-0011-5openalex-snapshot
The quotient algebra of labeled forests modulo h-equivalence
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/s10958-021-05422-2openalex-snapshot
Precomplete Numberings
inferred← citeshttps://doi.org/10.1016/0168-0072(94)00050-6openalex-snapshot
On recursively enumerable structures
inferred← citeshttps://doi.org/10.1016/j.apal.2011.12.029openalex-snapshot
Fine hierarchies via Priestley duality
inferred← citeshttps://doi.org/10.1016/j.apal.2019.102766openalex-snapshot
Turing reducibility in the fine hierarchy
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.020openalex-snapshot
A reducibility for the dot-depth hierarchy
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.1016/j.tcs.2022.12.016openalex-snapshot
Descriptive complexity of qcb0 -spaces
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00301-0openalex-snapshot
Fine hierarchy of regular ω-languages
inferred← citeshttps://doi.org/10.1017/jsl.2026.10205openalex-snapshot
BOREL WADGE CLASSES AND SELIVANOV’S FINE HIERARCHY I: EXTENDING TO THE HYPERARITHMETIC
inferred← citeshttps://doi.org/10.1017/s0960129516000177openalex-snapshot
Towards a descriptive theory of cb0-spaces
inferred← citeshttps://doi.org/10.1051/ita:2003008openalex-snapshot
Wadge Degrees ofω-Languages of Deterministic Turing Machines
inferred← citeshttps://doi.org/10.2307/2275522openalex-snapshot
Fine hierarchies and Boolean terms
inferred← citeshttps://doi.org/10.3233/com-180085openalex-snapshot
Extending Cooper’s theorem to Δ 3 0 Turing degrees
inferred← citeshttps://doi.org/10.3233/com-210376openalex-snapshot
Non-collapse of the effective Wadge 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.