On the public citation graph
e - ands -degrees
0 signed · 17 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.1007/bf01979705openalex-snapshot
Upper semilattice of recursively enumerable 124-1124-1124-1-degrees
inferredcites →https://doi.org/10.1090/s0002-9947-1968-0220595-7openalex-snapshot
Semirecursive Sets and Positive Reducibility
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
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.201200101openalex-snapshot
On the bounded quasi‐degrees of c.e. sets
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_50openalex-snapshot
s-Degrees within e-Degrees
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_6openalex-snapshot
Strong Positive Reducibilities
inferred← citeshttps://doi.org/10.1007/bf01978882openalex-snapshot
Degrees of denumerability reducibilities
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-006-0012-4openalex-snapshot
Strong Enumeration Reducibilities
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-011-0259-2openalex-snapshot
Bounded enumeration reducibility and its degree structure
inferred← citeshttps://doi.org/10.1007/s10469-017-9439-4openalex-snapshot
Irreducible, Singular, and Contiguous 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/0168-0072(90)90051-3openalex-snapshot
On restricted forms of enumeration reducibility
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.1017/9781316718254.020openalex-snapshot
On the structure of gamma 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.