On the public citation graph
A minimal degree not realizing least possible jump
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.
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.2307/1969604openalex-snapshot
On Degrees of Recursive Unsolvability
inferredcites →https://doi.org/10.2307/1970779openalex-snapshot
Initial Segments of the Degrees of Unsolvability
inferredcites →https://doi.org/10.2307/2270517openalex-snapshot
Initial segments of the degrees of unsolvability Part II: minimal degrees
inferredcites →https://doi.org/10.2307/2272061openalex-snapshot
Minimal degrees and the jump operator
inferredcites →https://doi.org/10.2307/2272735openalex-snapshot
Decidability of the “almost all” theory of degrees
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.19890350102openalex-snapshot
Embedding Lattices with Top Preserved Below Non‐GL2 Degrees
inferred← citeshttps://doi.org/10.1007/11780342_33openalex-snapshot
The Jump Classes of Minimal Covers
inferred← citeshttps://doi.org/10.1016/0168-0072(85)90001-6openalex-snapshot
Upper bounds for the arithmetical degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90022-9openalex-snapshot
Degrees which do not bound minimal degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2008.06.004openalex-snapshot
Π10 classes, LR degrees and Turing degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2014.04.002openalex-snapshot
A reducibility related to being hyperimmune-free
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80020-2openalex-snapshot
Local Degree Theory* *Preparation of this paper partially supported by E.P.S.R.C. research grants nos. GR/H91213 and GR/H02165, and by EC Human Capital and Mobility network ‘Complexity, Logic and Recursion Theory’.
inferred← citeshttps://doi.org/10.1017/s0960129506005603openalex-snapshot
Restricted jump interpolation in the d.c.e. degrees
inferred← citeshttps://doi.org/10.1090/s0002-9939-1982-0660612-6openalex-snapshot
Jumping to a Uniform Upper Bound
inferred← citeshttps://doi.org/10.1090/s0002-9947-1975-0392534-3openalex-snapshot
Minimal Covers and Hyperdegrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-1988-0973174-0openalex-snapshot
Decidability and Invariant Classes for Degree Structures
inferred← citeshttps://doi.org/10.2178/jsl/1102022219openalex-snapshot
Generalized high degrees have the complementation property
inferred← citeshttps://doi.org/10.2307/1971028openalex-snapshot
First-Order Theory of the Degrees of Recursive Unsolvability
inferred← citeshttps://doi.org/10.3233/com-170068openalex-snapshot
The search for natural definability in the Turing degrees
inferred← citeshttps://doi.org/10.4153/cjm-1977-105-5openalex-snapshot
Simple Proofs of Some Theorems on High Degrees of Unsolvability
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.