On the public citation graph
Weak density and cupping in the d-r.e. degrees
0 signed · 55 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.19680142105openalex-snapshot
A Dichotomy of the Recursively Enumerable Sets
inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bfb0090937openalex-snapshot
Hierarchies of sets and degrees below 0′
inferredcites →https://doi.org/10.1017/s0022481200051938openalex-snapshot
Boolean combinations of r.e. open sets
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1090/s0002-9947-1984-0719661-8openalex-snapshot
An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple 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/2274867openalex-snapshot
The strong anticupping property for recursively enumerable degrees
inferredcites →https://doi.org/10.2307/2275022openalex-snapshot
Complementation in the Turing degrees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1521-3870(200008)46:3<409::aid-malq409>3.0.co;2-popenalex-snapshot
There is No Low Maximal D.C.E. Degree
inferred← citeshttps://doi.org/10.1002/malq.19960420108openalex-snapshot
The Isolated D. R. E. Degrees are Dense in the R. E. Degrees
inferred← citeshttps://doi.org/10.1007/11494645_35openalex-snapshot
The Low Splitting Theorem in the Difference Hierarchy
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-642-03073-4_34openalex-snapshot
Infima of d.r.e. Degrees
inferred← citeshttps://doi.org/10.1007/bf01370692openalex-snapshot
The density of the low2 n-r.e. degrees
inferred← citeshttps://doi.org/10.1007/bf02878987openalex-snapshot
The weak density of properly d-r.e. branching degree in the d-r.e. degrees
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-004-0250-2openalex-snapshot
Isolation in the CEA hierarchy
inferred← citeshttps://doi.org/10.1007/s00153-024-00942-5openalex-snapshot
Degrees of relations on canonically ordered natural numbers and integers
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90005-7openalex-snapshot
The d.r.e. degrees are not dense
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.2003.10.002openalex-snapshot
Complementing cappable degrees in the difference hierarchy
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/j.apal.2007.01.002openalex-snapshot
Intervals containing exactly one c.e. degree
inferred← citeshttps://doi.org/10.1016/j.apal.2009.06.007openalex-snapshot
Extending and interpreting Post’s programme
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80045-5openalex-snapshot
Contributions to the history of variations of weak density in the n-R.E. Degrees
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.1016/s0168-0072(01)00117-8openalex-snapshot
Nonisolated degrees and the jump operator
inferred← citeshttps://doi.org/10.1017/s0960129508007226openalex-snapshot
Non-cupping, measure and computably enumerable splittings
inferred← citeshttps://doi.org/10.1017/s1079898600004819openalex-snapshot
2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02
inferred← citeshttps://doi.org/10.1090/s0002-9939-1992-1105037-0openalex-snapshot
A splitting theorem for the 𝑛-r.e. degrees
inferred← citeshttps://doi.org/10.1090/s0273-0979-1990-15923-3openalex-snapshot
The jump is definable in the structure of the degrees of unsolvability
inferred← citeshttps://doi.org/10.1093/logcom/exm032openalex-snapshot
Post's Programme for the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1112/blms/21.1.43openalex-snapshot
D.R.E. Degrees and the Nondiamond Theorem
inferred← citeshttps://doi.org/10.1134/s1995080220090048openalex-snapshot
Strong Degrees of Categoricity and Weak Density
inferred← citeshttps://doi.org/10.1142/9789812705815_0020openalex-snapshot
DIAMOND EMBEDDINGS INTO THE D.C.E. DEGREES WITH 0 AND 1 PRESERVED
inferred← citeshttps://doi.org/10.2178/bsl/1231081772openalex-snapshot
2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
inferred← citeshttps://doi.org/10.2178/jsl/1082418534openalex-snapshot
Bi-isolation in the d.c.e. degrees
inferred← citeshttps://doi.org/10.2178/jsl/1190150148openalex-snapshot
Isolation and lattice embeddings
inferred← citeshttps://doi.org/10.2307/2586839openalex-snapshot
Relative enumerability in the difference hierarchy
inferred← citeshttps://doi.org/10.2307/2687746openalex-snapshot
2001 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '01
inferred← citeshttps://doi.org/10.2307/421188openalex-snapshot
1998–99 Annual Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.3103/s1066369x09060127openalex-snapshot
Splitting in 2-computably enumerable degrees with avoiding cones
inferred← citeshttps://doi.org/10.3103/s1066369x10040092openalex-snapshot
Strong noncuppability in low computably enumerable degrees
inferred← citeshttps://doi.org/10.32657/10220/49671openalex-snapshot
Splitting theorems and strong reductions
inferred← citeshttps://doi.org/10.32657/10356/46540openalex-snapshot
Contributions to degree structures
inferred← citeshttps://doi.org/10.32657/10356/48687openalex-snapshot
Local structure theory and the Ershov hierarchy
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2022.8openalex-snapshot
Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order
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.