On the public citation graph

The density of the low2 n-r.e. degrees

https://doi.org/10.1007/bf01370692
0 signed · 28 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.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bf00968968openalex-snapshot
Ershov hierarchy
inferredcites →https://doi.org/10.1007/bf02937291openalex-snapshot
Weak density and cupping in the d-r.e. degrees
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-1992-1105037-0openalex-snapshot
A splitting theorem for the 𝑛-r.e. degrees
inferredcites →https://doi.org/10.1112/blms/21.1.43openalex-snapshot
D.R.E. Degrees and the Nondiamond Theorem
inferredcites →https://doi.org/10.2307/1970214openalex-snapshot
On the Degrees Less than 0 �
inferredcites →https://doi.org/10.2307/1970776openalex-snapshot
Interpolation and Embedding in the Recursively Enumerable Degrees
inferredcites →https://doi.org/10.2307/1970889openalex-snapshot
Jump Restricted Interpolation in the Recursively Enumerable Degrees

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_12openalex-snapshot
Definable Relations on the Computably Enumerable Degrees
inferred← citeshttps://doi.org/10.1007/978-3-030-22996-2_24openalex-snapshot
The d.r.e wtt-Degrees are Dense
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_27openalex-snapshot
A Survey of Results on the d-c.e. and n-c.e. Degrees
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_28openalex-snapshot
There Are No Maximal d.c.e. wtt-degrees
inferred← citeshttps://doi.org/10.1007/bfb0086111openalex-snapshot
On the structure of degrees below O′
inferred← citeshttps://doi.org/10.1007/s00153-004-0250-2openalex-snapshot
Isolation in the CEA hierarchy
inferred← citeshttps://doi.org/10.1007/s10958-021-05418-yopenalex-snapshot
Turing Computability: Structural Theory
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90238-9openalex-snapshot
Infima in the d.r.e. degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00070-4openalex-snapshot
A non-splitting theorem for d.r.e. sets
inferred← citeshttps://doi.org/10.1016/0168-0072(96)00014-0openalex-snapshot
Interpolating d-r.e. and REA degrees between r.e. degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2005.10.004openalex-snapshot
Bounding computably enumerable degrees in the Ershov hierarchy
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/s0960129516000244openalex-snapshot
Splitting and non-splitting in the difference hierarchy
inferred← citeshttps://doi.org/10.1134/s1995080214040209openalex-snapshot
A survey of results on the d.c.e. and n-c.e. degrees
inferred← citeshttps://doi.org/10.1134/s199508021606010xopenalex-snapshot
Elementary theories and structural properties of d-c.e. and n-c.e. degrees
inferred← citeshttps://doi.org/10.1360/02ys9124openalex-snapshot
Splitting and cone avoidance in the D.C.E. degrees
inferred← citeshttps://doi.org/10.2178/jsl/1082418534openalex-snapshot
Bi-isolation in the d.c.e. degrees
inferred← citeshttps://doi.org/10.3233/com-180092openalex-snapshot
S. Barry Cooper (1943–2015)
inferred← citeshttps://doi.org/10.32657/10220/49671openalex-snapshot
Splitting theorems and strong reductions
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.