On the public citation graph
Then-rea enumeration degrees are dense
0 signed · 48 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.19590050703openalex-snapshot
Reducibility and Completeness for Sets of Integers
inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bfb0086114openalex-snapshot
Enumeration reducibility, nondeterministic computations and relative computability of partial functions
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1090/s0002-9939-1961-0125794-xopenalex-snapshot
Note on Degrees of Partial Functions
inferredcites →https://doi.org/10.1090/s0002-9947-1968-0220595-7openalex-snapshot
Semirecursive Sets and Positive Reducibility
inferredcites →https://doi.org/10.2307/2273104openalex-snapshot
Partial degrees and the density problem
inferredcites →https://doi.org/10.2307/2274181openalex-snapshot
Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
inferredcites →https://doi.org/10.2307/2274273openalex-snapshot
Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
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-3-540-69407-6_59openalex-snapshot
Cupping Classes of $\Sigma^0_2$ Enumeration Degrees
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_18openalex-snapshot
The Strongest Nonsplitting Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_6openalex-snapshot
Strong Positive Reducibilities
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_56openalex-snapshot
An Application of 1-Genericity in the $\Pi^0_2$ Enumeration Degrees
inferred← citeshttps://doi.org/10.1007/bf01759368openalex-snapshot
Quasi-minimal enumeration degrees and minimal Turing degrees
inferred← citeshttps://doi.org/10.1007/bf02785966openalex-snapshot
There exists a maximal 3-C.E. enumeration degree
inferred← citeshttps://doi.org/10.1007/bf02808174openalex-snapshot
Branching in the enumeration degrees of the Σ 2 0 sets
inferred← citeshttps://doi.org/10.1007/s00153-002-0161-zopenalex-snapshot
Limit lemmas and jump inversion in the enumeration degrees
inferred← citeshttps://doi.org/10.1007/s00153-006-0012-4openalex-snapshot
Strong Enumeration Reducibilities
inferred← citeshttps://doi.org/10.1007/s00153-008-0081-7openalex-snapshot
Branching in the $${\Sigma^0_2}$$ -enumeration degrees: a new perspective
inferred← citeshttps://doi.org/10.1007/s00153-009-0171-1openalex-snapshot
The limitations of cupping in the local structure of the enumeration degrees
inferred← citeshttps://doi.org/10.1007/s00153-010-0192-9openalex-snapshot
Goodness in the enumeration and singleton degrees
inferred← citeshttps://doi.org/10.1007/s00153-012-0268-9openalex-snapshot
Badness and jump inversion in the enumeration degrees
inferred← citeshttps://doi.org/10.1007/s001530100078openalex-snapshot
Density results in the Δ 2 0 e-degrees
inferred← citeshttps://doi.org/10.1007/s10469-025-09804-2openalex-snapshot
Every Nonzero Enumeration Degree Contains Infinitely Many Singleton Degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2008.12.002openalex-snapshot
The structure of the s -degrees contained within a single e -degree
inferred← citeshttps://doi.org/10.1016/j.apal.2009.01.003openalex-snapshot
The jump operator on the ω -enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2009.01.009openalex-snapshot
A non-splitting theorem in the enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2014.04.008openalex-snapshot
Avoiding uniformity in the Δ20 enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2018.01.001openalex-snapshot
Density of the cototal enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2025.103616openalex-snapshot
The singleton degrees of the Σ20 sets are not dense
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.1090/s0002-9947-2014-06157-6openalex-snapshot
Definability via Kalimullin pairs in the structure of the enumeration degrees
inferred← citeshttps://doi.org/10.1090/tran/7604openalex-snapshot
On cototality and the skip operator in the enumeration degrees
inferred← citeshttps://doi.org/10.1093/logcom/exq044openalex-snapshot
Non-cuppable enumeration degrees via finite injury
inferred← citeshttps://doi.org/10.1093/logcom/exq051openalex-snapshot
Embedding countable partial orderings in the enumeration degrees and the -enumeration degrees
inferred← citeshttps://doi.org/10.1093/logcom/ext041openalex-snapshot
Effective properties of Marker's extensions
inferred← citeshttps://doi.org/10.1142/s0219061305000432openalex-snapshot
ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
inferred← citeshttps://doi.org/10.1215/00294527-2018-0008openalex-snapshot
Enumeration 1-Genericity in the Local Enumeration Degrees
inferred← citeshttps://doi.org/10.2178/jsl/1164060455openalex-snapshot
The Π3-theory of the -enumeration degrees is undecidable
inferred← citeshttps://doi.org/10.2178/jsl/1203350795openalex-snapshot
Bounding nonsplitting enumeration degrees
inferred← citeshttps://doi.org/10.2178/jsl/1208359064openalex-snapshot
How enumeration reductibility yields extended Harrington non-splitting
inferred← citeshttps://doi.org/10.2178/jsl/1268917493openalex-snapshot
Interpreting true arithmetic in the -enumeration degrees
inferred← citeshttps://doi.org/10.2178/jsl/1294170994openalex-snapshot
On the jump classes of noncuppable enumeration degrees
inferred← citeshttps://doi.org/10.2178/jsl/1327068696openalex-snapshot
Cupping and definability in the local structure of the enumeration degrees
inferred← citeshttps://doi.org/10.3233/com-170072openalex-snapshot
The jump hierarchy in the enumeration 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.