On the public citation graph
Minimal degrees and the jump operator
0 signed · 66 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.1002/malq.19680140704openalex-snapshot
The Degrees of Hyperimmune Sets
inferredcites →https://doi.org/10.1002/malq.19680142105openalex-snapshot
A Dichotomy of the Recursively Enumerable Sets
inferredcites →https://doi.org/10.1112/plms/s3-16.1.537openalex-snapshot
Lower Bounds for Pairs of Recursively Enumerable Degrees
inferredcites →https://doi.org/10.1112/plms/s3-19.1.1openalex-snapshot
Initial Segments of Turing Degrees
inferredcites →https://doi.org/10.1515/9781400882229-003openalex-snapshot
Annals of Mathematics Studies
inferredcites →https://doi.org/10.2307/1969604openalex-snapshot
On Degrees of Recursive 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.200410027openalex-snapshot
Properly ?2 minimal degrees and 0? complementation
inferred← citeshttps://doi.org/10.1002/malq.200410044openalex-snapshot
The minimal complementation property above 0′
inferred← citeshttps://doi.org/10.1007/11494645_35openalex-snapshot
The Low Splitting Theorem in the Difference Hierarchy
inferred← citeshttps://doi.org/10.1007/11780342_33openalex-snapshot
The Jump Classes of Minimal Covers
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_17openalex-snapshot
Thin Maximal Antichains in the Turing Degrees
inferred← citeshttps://doi.org/10.1007/bf01275466openalex-snapshot
The rhombus classes of degrees of unsolvability (I), The jump properties
inferred← citeshttps://doi.org/10.1007/bfb0086114openalex-snapshot
Enumeration reducibility, nondeterministic computations and relative computability of partial functions
inferred← citeshttps://doi.org/10.1007/s00153-009-0149-zopenalex-snapshot
Continuous versus Borel reductions
inferred← citeshttps://doi.org/10.1007/s00224-017-9798-1openalex-snapshot
On the Uniform Computational Content of Computability Theory
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/0168-0072(88)90034-6openalex-snapshot
A non-inversion theorem for the jump operator
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/j.apal.2003.07.001openalex-snapshot
Completing pseudojump operators
inferred← citeshttps://doi.org/10.1016/j.apal.2003.10.002openalex-snapshot
Complementing cappable degrees in the difference hierarchy
inferred← citeshttps://doi.org/10.1016/j.apal.2005.06.012openalex-snapshot
1-Generic splittings of computably enumerable degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.008openalex-snapshot
Tracing and domination in the Turing degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2013.10.005openalex-snapshot
2-Minimality, jump classes and a note on natural definability
inferred← citeshttps://doi.org/10.1016/j.apal.2016.11.011openalex-snapshot
Dominating the Erdős–Moser theorem in reverse mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71117-0openalex-snapshot
Degrees of Unsolvability: A Survey of Results
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/bsl.2016.17openalex-snapshot
IN MEMORIAM: BARRY COOPER 1943–2015
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.011openalex-snapshot
Strong minimal covers and a question of Yates: The story so far
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.005openalex-snapshot
Computability theory, algorithmic randomness and Turing's anticipation
inferred← citeshttps://doi.org/10.1017/jsl.2018.68openalex-snapshot
A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
inferred← citeshttps://doi.org/10.1090/memo/1284openalex-snapshot
Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees
inferred← citeshttps://doi.org/10.1090/s0002-9939-10-10299-8openalex-snapshot
Joining up to the generalized high degrees
inferred← citeshttps://doi.org/10.1090/s0002-9939-1973-0311467-5openalex-snapshot
A minimal partial degree ≤𝑂^{’}
inferred← citeshttps://doi.org/10.1090/s0002-9939-2014-11868-5openalex-snapshot
Cofinal maximal chains in the Turing degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-07-04331-0openalex-snapshot
A single minimal complement for the c.e. degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-09-04783-7openalex-snapshot
A Π¹₁-uniformization principle for reals
inferred← citeshttps://doi.org/10.1090/s0002-9947-1975-0392534-3openalex-snapshot
Minimal Covers and Hyperdegrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-1979-0539912-0openalex-snapshot
Generic sets and minimal 𝛼-degrees
inferred← citeshttps://doi.org/10.1112/jlms/s2-24.1.1openalex-snapshot
The Theory of the Degrees below 0 ′
inferred← citeshttps://doi.org/10.1112/jlms/s2-5.3.445openalex-snapshot
Minimal Upper Bounds for Sequences of Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.1215/00294527-1306181openalex-snapshot
Van Lambalgen's Theorem and High Degrees
inferred← citeshttps://doi.org/10.1215/00294527-2010-028openalex-snapshot
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree
inferred← citeshttps://doi.org/10.2178/bsl/1154698739openalex-snapshot
Degree Structures: Local and Global Investigations
inferred← citeshttps://doi.org/10.2178/jsl/1102022208openalex-snapshot
Minimal complements for degrees below 0′
inferred← citeshttps://doi.org/10.2178/jsl/1102022219openalex-snapshot
Generalized high degrees have the complementation property
inferred← citeshttps://doi.org/10.2178/jsl/1305810761openalex-snapshot
Jump inversions inside effectively closed sets and applications to randomness
inferred← citeshttps://doi.org/10.2307/1971028openalex-snapshot
First-Order Theory of the Degrees of Recursive Unsolvability
inferred← citeshttps://doi.org/10.2307/2272899openalex-snapshot
A minimal degree not realizing least possible jump
inferred← citeshttps://doi.org/10.2307/2273144openalex-snapshot
Double jumps of minimal degrees over cardinals
inferred← citeshttps://doi.org/10.2307/2273220openalex-snapshot
The upper semilattice of degrees ≤ 0′ is complemented
inferred← citeshttps://doi.org/10.2307/2275099openalex-snapshot
Working below a high recursively enumerable degree
inferred← citeshttps://doi.org/10.2307/2275754openalex-snapshot
Degree theoretic definitions of the low2 recursively enumerable sets
inferred← citeshttps://doi.org/10.4153/cjm-1977-105-5openalex-snapshot
Simple Proofs of Some Theorems on High Degrees of Unsolvability
inferred← citeshttps://doi.org/10.5539/jmr.v9n4p69openalex-snapshot
Cone Avoidance of Some Turing Degrees
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.