On the public citation graph

Completeness in the arithmetical hierarchy and fixed points

https://doi.org/10.1007/bf01980603
0 signed · 22 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/bf02218750openalex-snapshot
A hierarchy of sets. I
inferredcites →https://doi.org/10.1090/s0002-9947-1966-0184855-9openalex-snapshot
On the Degrees of Index Sets
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0241295-4openalex-snapshot
On the Degrees of Index Sets. II
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2307/1970393openalex-snapshot
The Recursively Enumerable Degrees are Dense
inferredcites →https://doi.org/10.2307/2274271openalex-snapshot
Definable structures in the lattice of recursively enumerable sets
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.4153/cjm-1975-043-4openalex-snapshot
Rice Theorems For D.R.E. Sets

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-1-4615-0755-0_1openalex-snapshot
Truth-Table Complete Computably Enumerable Sets
inferred← citeshttps://doi.org/10.1007/978-1-4615-0755-0_14openalex-snapshot
Positive Structures
inferred← citeshttps://doi.org/10.1007/s00153-023-00896-0openalex-snapshot
On diagonal functions for equivalence relations
inferred← citeshttps://doi.org/10.1007/s10958-021-05422-2openalex-snapshot
Precomplete Numberings
inferred← citeshttps://doi.org/10.1016/j.ic.2014.02.002openalex-snapshot
Things that can be made into themselves
inferred← citeshttps://doi.org/10.1093/logcom/exy036openalex-snapshot
On the connections between $wtt$- and $Q$-reducibilities
inferred← citeshttps://doi.org/10.1134/s1995080221040041openalex-snapshot
Fixed-point Selection Functions
inferred← citeshttps://doi.org/10.1134/s1995080222150057openalex-snapshot
On a General Method of Constructing Post Reducibilities and the Corresponding Completeness Criteria
inferred← citeshttps://doi.org/10.1215/00294527-2008-001openalex-snapshot
Immunity and Hyperimmunity for Sets of Minimal Indices
inferred← citeshttps://doi.org/10.26907/2949-3919.2026.1.119-132openalex-snapshot
Arslanovs’ completeness criteria and linear reducibility
inferred← citeshttps://doi.org/10.3103/s1066369x22100012openalex-snapshot
Completeness Criteria for a Class of Reducibilities
inferred← citeshttps://doi.org/10.4213/rm10168openalex-snapshot
Марат Мирзаевич Арсланов (к восьмидесятилетию со дня рождения)
inferred← citeshttps://doi.org/10.4213/rm10168eopenalex-snapshot
Marat Mirzaevich Arslanov (on his eightieth birthday)
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.