On the public citation graph

Numberings, c.e. oracles, and fixed points

https://doi.org/10.3233/com-210387
0 signed · 34 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.19570031202openalex-snapshot
[Russian Text Ignored]
inferredcites →https://doi.org/10.1002/malq.19660120125openalex-snapshot
Classes of Recursively Enumerable Sets and Degrees of Unsolvability
inferredcites →https://doi.org/10.1002/malq.19690150707openalex-snapshot
The degrees of bi‐immune sets
inferredcites →https://doi.org/10.1007/11494645_64openalex-snapshot
Computable Analysis
inferredcites →https://doi.org/10.1007/978-1-4615-0755-0_2openalex-snapshot
Completeness and Universality of Arithmetical Numberings
inferredcites →https://doi.org/10.1007/978-3-319-50062-1_25openalex-snapshot
A Survey on Universal Computably Enumerable Equivalence Relations
inferredcites →https://doi.org/10.1007/978-3-642-31933-4openalex-snapshot
Turing Computability: Theory and Applications
inferredcites →https://doi.org/10.1007/978-3-642-69965-8openalex-snapshot
Computability
inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/978-94-015-8232-2openalex-snapshot
Algorithms: Main Ideas and Applications
inferredcites →https://doi.org/10.1007/bf00972779openalex-snapshot
On weakly pre-complete positive equivalences
inferredcites →https://doi.org/10.1007/bf01669607openalex-snapshot
Computable single-valued numerations
inferredcites →https://doi.org/10.1007/bf01792984openalex-snapshot
Some applications of computable one-one numberings
inferredcites →https://doi.org/10.1007/bf02219043openalex-snapshot
On inseparable pairs
inferredcites →https://doi.org/10.1007/bf02671553openalex-snapshot
Generalized computable numerations and nontrivial rogers semilattices
inferredcites →https://doi.org/10.1016/j.apal.2019.04.013openalex-snapshot
Fixed point theorems for precomplete numberings
inferredcites →https://doi.org/10.1016/j.tcs.2010.12.041openalex-snapshot
Inductive inference and computable numberings
inferredcites →https://doi.org/10.1016/s0049-237x(99)80030-5openalex-snapshot
Theory of Numberings
inferredcites →https://doi.org/10.1017/s1755020320000192openalex-snapshot
ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS
inferredcites →https://doi.org/10.1070/rm1961v016n03abeh001120openalex-snapshot
CONSTRUCTIVE ALGEBRAS I
inferredcites →https://doi.org/10.2307/2964292openalex-snapshot
Gödel numberings of partial recursive functions
inferredcites →https://doi.org/10.4153/cjm-1972-113-9openalex-snapshot
Degrees in Which the Recursive Sets are Uniformly Recursive

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-024-00914-9openalex-snapshot
On computable numberings of families of Turing degrees
inferred← citeshttps://doi.org/10.1007/s00224-024-10165-zopenalex-snapshot
On Non-principal Arithmetical Numberings and Families
inferred← citeshttps://doi.org/10.1007/s00224-025-10222-1openalex-snapshot
Control Structures in Computable Numberings and the Completion Operator
inferred← citeshttps://doi.org/10.1007/s10469-026-09832-6openalex-snapshot
One Property of Complete Numberings of Computable and Generalized Computable Families
inferred← citeshttps://doi.org/10.1007/s10849-025-09430-2openalex-snapshot
A Family Whose Computable Numberings are All Complete
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103523openalex-snapshot
Some properties of precompletely and positively numbered sets
inferred← citeshttps://doi.org/10.1017/s0960129526100541openalex-snapshot
Relative completeness of arithmetical numberings
inferred← citeshttps://doi.org/10.1093/logcom/exad074openalex-snapshot
Fixed point theorems for minimal numberings
inferred← citeshttps://doi.org/10.1142/s0129054125500248openalex-snapshot
Recursion Theorems in Numbered Sets
inferred← citeshttps://doi.org/10.20944/preprints202312.1276.v1openalex-snapshot
Withdrawn: Fixed Point Properties of Precompletely and Positively Numbered Sets
inferred← citeshttps://doi.org/10.31219/osf.io/tmg9sopenalex-snapshot
Fixed point properties of numbered families
inferred← citeshttps://doi.org/10.3233/com-230951openalex-snapshot
On the main scientific achievements of Victor Selivanov
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.