On the public citation graph
On the reducibility of computable numerations
0 signed · 16 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-9939-1964-0174479-5openalex-snapshot
Gödel numberings versus Friedberg numberings
inferredcites →https://doi.org/10.1215/s0012-7094-65-03247-3openalex-snapshot
Three theorems on the degrees of recursively enumerable sets
inferredcites →https://doi.org/10.2307/2964290openalex-snapshot
Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
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.19800262804openalex-snapshot
Reduzierbarkeit von Berechenbaren Numerierungen von P1
inferred← citeshttps://doi.org/10.1007/3-540-19020-1_20openalex-snapshot
Computable one-to-one enumerations of effective domains
inferred← citeshttps://doi.org/10.1007/978-3-642-30870-3_51openalex-snapshot
Characteristics of Minimal Effective Programming Systems
inferred← citeshttps://doi.org/10.1007/bf00969237openalex-snapshot
Enumerations of canonically calculable families of finite sets
inferred← citeshttps://doi.org/10.1007/bf01669607openalex-snapshot
Computable single-valued numerations
inferred← citeshttps://doi.org/10.1007/bf01792984openalex-snapshot
Some applications of computable one-one numberings
inferred← citeshttps://doi.org/10.1007/bf02306734openalex-snapshot
Two existence theorems for computable numerations
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90032-dopenalex-snapshot
Computable one-to-one enumerations of effective domains
inferred← citeshttps://doi.org/10.1134/s0037446619020046openalex-snapshot
Rogers Semilattices for Families of Equivalence Relations in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.3233/com-230463openalex-snapshot
How much partiality is needed for a theory of computability?
inferred← citeshttps://doi.org/10.48550/arxiv.1508.04387openalex-snapshot
Game arguments in some existence theorems of Friedberg numberings
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.