On the public citation graph
Upper semilattice of recursively enumerable 124-1124-1124-1-degrees
0 signed · 18 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.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.2140/pjm.1973.46.167openalex-snapshot
The class of recursively enumerable subsets of a recursively enumerable set
inferredcites →https://doi.org/10.2307/2271876openalex-snapshot
Computational complexity, speedable and levelable sets
inferredcites →https://doi.org/10.2307/2271984openalex-snapshot
On complexity properties of recursively enumerable sets
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-1-4615-0755-0_13openalex-snapshot
Quasi-Degrees of Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.1007/bf01158060openalex-snapshot
Classes of recursively enumerable sets and Q-reducibility
inferred← citeshttps://doi.org/10.1007/bf01985061openalex-snapshot
Upper semilattice of recursively enumerable sQ-degrees
inferred← citeshttps://doi.org/10.1007/bf02674875openalex-snapshot
Some reducibilities and splittings of recursively enumerable sets
inferred← citeshttps://doi.org/10.1007/s00153-015-0451-xopenalex-snapshot
Some properties of r-maximal sets and Q 1,N -reducibility
inferred← citeshttps://doi.org/10.1007/s00153-021-00774-7openalex-snapshot
Degree structures of conjunctive reducibility
inferred← citeshttps://doi.org/10.1007/s00153-022-00847-1openalex-snapshot
$$sQ_1$$-degrees of computably enumerable sets
inferred← citeshttps://doi.org/10.1093/jigpal/jzaf072openalex-snapshot
On minimal pairs of quasi-degrees
inferred← citeshttps://doi.org/10.1093/logcom/exy036openalex-snapshot
On the connections between $wtt$- and $Q$-reducibilities
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.