On the public citation graph

Two existence theorems for computable numerations

https://doi.org/10.1007/bf02306734
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.1002/malq.19660120125openalex-snapshot
Classes of Recursively Enumerable Sets and Degrees of Unsolvability
inferredcites →https://doi.org/10.1007/bf02219834openalex-snapshot
On the reducibility of computable numerations
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/2314466openalex-snapshot
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-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/bf00970493openalex-snapshot
A problem of S. S. Goncharov
inferred← citeshttps://doi.org/10.1007/bf01669607openalex-snapshot
Computable single-valued numerations
inferred← citeshttps://doi.org/10.1007/s10469-015-9340-yopenalex-snapshot
Ideals Without Minimal Elements in Rogers Semilattices
inferred← citeshttps://doi.org/10.1007/s10469-022-09688-6openalex-snapshot
Minimal Generalized Computable Numberings and Families of Positive Preorders
inferred← citeshttps://doi.org/10.1007/s10469-026-09812-wopenalex-snapshot
On the Number of Minimal Elements of Ideals of Rogers Semilattices
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90076-popenalex-snapshot
Some effectively infinite classes of enumerations
inferred← citeshttps://doi.org/10.1134/s0037446617060192openalex-snapshot
The Rogers Semilattices of Generalized Computable Enumerations
inferred← citeshttps://doi.org/10.1134/s0037446619020046openalex-snapshot
Rogers Semilattices for Families of Equivalence Relations in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1134/s0037446621010031openalex-snapshot
On Universal Pairs in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.55452/1998-6688-2023-20-1-14-20openalex-snapshot
ON THE EXISTENCE OF UNIVERSAL 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.