On the public citation graph
A note on the hyperarithmetical hierarchy
0 signed · 42 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1090/s0002-9904-1960-10518-6openalex-snapshot
On a problem of Kleene’s
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0242673-xopenalex-snapshot
A Recursion-Theoretic Characterization of the Ramified Analytical Hierarchy
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2307/1969604openalex-snapshot
On Degrees of Recursive Unsolvability
inferredcites →https://doi.org/10.2307/2270584openalex-snapshot
On the notational independence of various hierarchies of degrees of unsolvability
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/978-3-319-50062-1_19openalex-snapshot
Enumeration Reducibility and Computable Structure Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_26openalex-snapshot
The Strength of the Besicovitch-Davies Theorem
inferred← citeshttps://doi.org/10.1016/0003-4843(76)90023-1openalex-snapshot
A degree-theoretic definition of the ramified analytical hierarchy
inferred← citeshttps://doi.org/10.1016/0168-0072(85)90001-6openalex-snapshot
Upper bounds for the arithmetical degrees
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70601-3openalex-snapshot
An Uncritical Bibliography of Papers on Generalized Recursion Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71263-1openalex-snapshot
The Hierarchy Based on the Jump Operator*
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71365-xopenalex-snapshot
A Finite Combinatorial Principle Which is Equivalent to the 1-Consistency of Predicative Analysis
inferred← citeshttps://doi.org/10.1017/9781316718254.005openalex-snapshot
Definability and global degree theory
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.012openalex-snapshot
Embeddings into the Turing degrees
inferred← citeshttps://doi.org/10.1017/jsl.2013.27openalex-snapshot
THE STRENGTH OF RAMSEY’S THEOREM FOR COLORING RELATIVELY LARGE SETS
inferred← citeshttps://doi.org/10.1017/jsl.2021.37openalex-snapshot
A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES
inferred← citeshttps://doi.org/10.1090/jams/980openalex-snapshot
Effective randomness for continuous measures
inferred← citeshttps://doi.org/10.1090/proc/15125openalex-snapshot
Incompleteness and jump hierarchies
inferred← citeshttps://doi.org/10.1090/s0002-9939-1983-0684647-3openalex-snapshot
On the First Order Theory of the Arithmetical Degrees
inferred← citeshttps://doi.org/10.1090/s0002-9939-1988-0958085-4openalex-snapshot
Defining Jump Classes in the Degrees Below 0'
inferred← citeshttps://doi.org/10.1142/9789812796554_0011openalex-snapshot
A CUPPABLE NON-BOUNDING DEGREE
inferred← citeshttps://doi.org/10.1142/9789813223523_0006openalex-snapshot
HIGHER RANDOMNESS AND LIM-SUP FORCING WITHIN AND BEYOND HYPERARITHMETIC
inferred← citeshttps://doi.org/10.2178/jsl.7802050openalex-snapshot
A fixed point for the jump operator on structures
inferred← citeshttps://doi.org/10.2178/jsl/1208359051openalex-snapshot
Realsn-generic relative to some perfect tree
inferred← citeshttps://doi.org/10.2307/2272637openalex-snapshot
Systems of notations and the ramified analytical hierarchy
inferred← citeshttps://doi.org/10.2307/2273224openalex-snapshot
Upper bounds on locally countable admissible initial segments of a Turing degree hierarchy
inferred← citeshttps://doi.org/10.2307/2273465openalex-snapshot
Forcing and reductibilities. II. Forcing in fragments of analysis
inferred← citeshttps://doi.org/10.2307/2274174openalex-snapshot
Two theorems on degrees of models of true arithmetic
inferred← citeshttps://doi.org/10.2307/2274273openalex-snapshot
Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
inferred← citeshttps://doi.org/10.2307/2274280openalex-snapshot
Finite level Borel games and a problem concerning the jump hierarchy
inferred← citeshttps://doi.org/10.2307/2275404openalex-snapshot
Minimal upper bounds for arithmetical degrees
inferred← citeshttps://doi.org/10.2307/2275810openalex-snapshot
Minimal complementation below uniform upper bounds for the arithmetical degrees
inferred← citeshttps://doi.org/10.48550/arxiv.1106.0908openalex-snapshot
A fixed point for the jump operator on structures
inferred← citeshttps://doi.org/10.48550/arxiv.1204.1134openalex-snapshot
The strength of Ramsey Theorem for coloring relatively large sets
inferred← citeshttps://doi.org/10.48550/arxiv.1408.1999openalex-snapshot
Finding subsets of positive measure
inferred← citeshttps://doi.org/10.70675/e79cdee4z2c0fz43cdzb831z9c7b327fe351openalex-snapshot
Infinite Computations in Algorithmic Randomness and Reverse Mathematics
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.