On the public citation graph

Partial degrees and the density problem

0 signed · 58 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.1016/0003-4843(71)90003-9openalex-snapshot
Enumeration reducibility and partial degrees
inferredcites →https://doi.org/10.1017/cbo9780511629181.002openalex-snapshot
Fundamental Methods for Constructing Recursively Enumerable 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-9939-1973-0311467-5openalex-snapshot
A minimal partial degree ≤𝑂^{’}
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.1002/malq.19870330608openalex-snapshot
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
inferred← citeshttps://doi.org/10.1002/malq.19970430302openalex-snapshot
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds
inferred← citeshttps://doi.org/10.1002/malq.19980440402openalex-snapshot
Some Special Pairs of Σ2 e‐Degrees
inferred← citeshttps://doi.org/10.1007/11494645_56openalex-snapshot
Minimal Pairs and Quasi-minimal Degrees for the Joint Spectra of Structures
inferred← citeshttps://doi.org/10.1007/11780342_56openalex-snapshot
Relativized Degree Spectra
inferred← citeshttps://doi.org/10.1007/978-1-4613-0609-2_17openalex-snapshot
1-Generic Enumeration Degrees Below O e ’
inferred← citeshttps://doi.org/10.1007/978-1-4615-0755-0_15openalex-snapshot
Local Properties of the Non-Total Enumeration Degrees
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_58openalex-snapshot
ω-Degree Spectra
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-73001-9_77openalex-snapshot
Cupping $\Delta_2^0$ Enumeration Degrees to 0 e ′
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-39053-1_43openalex-snapshot
A Note on ω-Jump Inversion of Degree Spectra of Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-39053-1_44openalex-snapshot
The Turing Universe in the Context of Enumeration Reducibility
inferred← citeshttps://doi.org/10.1007/bf01759368openalex-snapshot
Quasi-minimal enumeration degrees and minimal Turing degrees
inferred← citeshttps://doi.org/10.1007/bf01793784openalex-snapshot
On some filters and ideals of the Medvedev lattice
inferred← citeshttps://doi.org/10.1007/bf01794984openalex-snapshot
Then-rea enumeration degrees are dense
inferred← citeshttps://doi.org/10.1007/bf01978882openalex-snapshot
Degrees of denumerability reducibilities
inferred← citeshttps://doi.org/10.1007/bf02785966openalex-snapshot
There exists a maximal 3-C.E. enumeration degree
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-0245-zopenalex-snapshot
The jump operation for structure degrees
inferred← citeshttps://doi.org/10.1007/s00153-006-0012-4openalex-snapshot
Strong Enumeration Reducibilities
inferred← citeshttps://doi.org/10.1007/s00153-006-0021-3openalex-snapshot
A high noncuppable $${\Sigma^0_2}$$ e-degree
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/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.2004.04.010openalex-snapshot
The minimal e-degree problem in fragments of Peano arithmetic
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.2025.103616openalex-snapshot
The singleton degrees of the Σ20 sets are not dense
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80019-6openalex-snapshot
Reducibilities
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00076-6openalex-snapshot
Sets of generators and automorphism bases for the enumeration degrees
inferred← citeshttps://doi.org/10.1017/9781316756140.006openalex-snapshot
Relative Splittings of in the-Enumeration Degrees
inferred← citeshttps://doi.org/10.1017/jsl.2013.1openalex-snapshot
A NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES
inferred← citeshttps://doi.org/10.1017/s0960129508007378openalex-snapshot
Cupping Δ20 enumeration degrees to 0e′
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.1093/logcom/exm041openalex-snapshot
The -Enumeration Degrees
inferred← citeshttps://doi.org/10.1093/logcom/exq039openalex-snapshot
Turing and enumeration jumps in the Ershov hierarchy
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.1134/s0037446613060177openalex-snapshot
Complements for enumeration Π01-degrees
inferred← citeshttps://doi.org/10.2178/jsl/1082418543openalex-snapshot
Degrees of unsolvability of continuous functions
inferred← citeshttps://doi.org/10.2178/jsl/1122038912openalex-snapshot
Bounding and nonbounding minimal pairs in the enumeration degrees
inferred← citeshttps://doi.org/10.2178/jsl/1190150030openalex-snapshot
Embedding finite lattices into the Σ20 enumeration degrees
inferred← citeshttps://doi.org/10.2307/2273985openalex-snapshot
On minimal pairs of enumeration degrees
inferred← citeshttps://doi.org/10.2307/2274181openalex-snapshot
Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
inferred← citeshttps://doi.org/10.2307/2274313openalex-snapshot
On the T-degrees of partial functions
inferred← citeshttps://doi.org/10.2307/2274578openalex-snapshot
1-genericity in the enumeration degrees
inferred← citeshttps://doi.org/10.2307/2274668openalex-snapshot
Some remarks on the algebraic structure of the Medvedev Lattice
inferred← citeshttps://doi.org/10.2307/2274914openalex-snapshot
Embedding the diamond in the Σ2 enumeration degrees
inferred← citeshttps://doi.org/10.2307/2275820openalex-snapshot
Noncappable enumeration degrees below 0e′
inferred← citeshttps://doi.org/10.3233/com-170072openalex-snapshot
The jump hierarchy in the enumeration degrees
inferred← citeshttps://doi.org/10.3233/com-180092openalex-snapshot
S. Barry Cooper (1943–2015)
inferred← citeshttps://doi.org/10.48550/arxiv.1904.04107openalex-snapshot
Enumeration degrees and non-metrizable topology
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.