On the public citation graph
Descending sequences of degrees
0 signed · 21 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-9947-1968-0244049-7openalex-snapshot
Recursive Pseudo-Well-Orderings
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2307/2270699openalex-snapshot
A note on the hyperarithmetical hierarchy
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/s00153-014-0392-9openalex-snapshot
From hierarchies to well-foundedness
inferred← citeshttps://doi.org/10.1016/j.apal.2009.01.001openalex-snapshot
Reverse mathematics and well-ordering principles: A pilot study
inferred← citeshttps://doi.org/10.1016/j.apal.2015.10.004openalex-snapshot
Duality, non-standard elements, and dynamic properties of r.e. sets
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70514-2openalex-snapshot
Σ1 and Π1 Transfinite Induction
inferred← citeshttps://doi.org/10.1017/bsl.2025.10137openalex-snapshot
ON THE HIERARCHY OF NATURAL THEORIES
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.012openalex-snapshot
Embeddings into the Turing degrees
inferred← citeshttps://doi.org/10.1017/jsl.2021.37openalex-snapshot
A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES
inferred← citeshttps://doi.org/10.1017/s1755020316000411openalex-snapshot
THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC
inferred← citeshttps://doi.org/10.1090/proc/15125openalex-snapshot
Incompleteness and jump hierarchies
inferred← citeshttps://doi.org/10.1142/9781848162778_0011openalex-snapshot
Reverse Mathematics and Well-ordering Principles
inferred← citeshttps://doi.org/10.1142/9789812796554_0019openalex-snapshot
A tt VERSION OF THE POSNER-ROBINSON THEOREM
inferred← citeshttps://doi.org/10.1305/ndjfl/1093635587openalex-snapshot
Enumerations of Turing ideals with applications.
inferred← citeshttps://doi.org/10.2178/jsl/1082418545openalex-snapshot
An incompleteness theorem for βn-models
inferred← citeshttps://doi.org/10.2748/tmj/1325886278openalex-snapshot
Mass problems associated with effectively closed sets
inferred← citeshttps://doi.org/10.48550/arxiv.1612.06219openalex-snapshot
The Prehistory of the Subsystems of Second-Order Arithmetic
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.