On the public citation graph
Recursive Enumerability and the Jump Operator
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.1142/9789812564894_0026openalex-snapshot
ON DEGREES OF RECURSIVE UNSOLVABILITY
inferredcites →https://doi.org/10.2307/1969708openalex-snapshot
The Upper Semi-Lattice of Degrees of Recursive Unsolvability
inferredcites →https://doi.org/10.2307/2964177openalex-snapshot
A criterion for completeness of degrees of unsolvability
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.19860320103openalex-snapshot
A Refinement of Low n and High n for the R.E. Degrees
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_7openalex-snapshot
Elementary Differences Among Jump Hierarchies
inferred← citeshttps://doi.org/10.1090/s0002-9904-1974-13350-1openalex-snapshot
Automorphisms of the lattice of recursively enumerable sets
inferred← citeshttps://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-03-03406-8openalex-snapshot
The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
inferred← citeshttps://doi.org/10.1090/s0002-9947-1983-0697077-xopenalex-snapshot
Inverting the Half-Jump
inferred← citeshttps://doi.org/10.1090/s0002-9947-2012-05600-5openalex-snapshot
The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$
inferred← citeshttps://doi.org/10.1134/s1995080226617157openalex-snapshot
Weak Jumps in the Elementary Degrees and Jump Inversion Theorems
inferred← citeshttps://doi.org/10.1215/00294527-2008-001openalex-snapshot
Immunity and Hyperimmunity for Sets of Minimal Indices
inferred← citeshttps://doi.org/10.2969/jmsj/02040609openalex-snapshot
An investigation on degrees of unsolvability
inferred← citeshttps://doi.org/10.32657/10356/165558openalex-snapshot
Cupping in the computably enumerable degrees
inferred← citeshttps://doi.org/10.32657/10356/48687openalex-snapshot
Local structure theory and the Ershov hierarchy
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.