On the public citation graph

Embedding the diamond in the Σ2 enumeration degrees

0 signed · 23 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.1016/0003-4843(72)90011-3openalex-snapshot
Degrees of unsolvability complementary between recursively enumerable degrees, Part 1
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1112/plms/s3-16.1.537openalex-snapshot
Lower Bounds for Pairs of Recursively Enumerable Degrees
inferredcites →https://doi.org/10.2307/2273104openalex-snapshot
Partial degrees and the density problem
inferredcites →https://doi.org/10.2307/2273985openalex-snapshot
On minimal pairs of enumeration degrees
inferredcites →https://doi.org/10.2307/2274335openalex-snapshot
Jumps of quasi-minimal enumeration degrees
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.1007/978-3-540-79228-4_49openalex-snapshot
Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees
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/bf02808174openalex-snapshot
Branching in the enumeration degrees of the Σ 2 0 sets
inferred← citeshttps://doi.org/10.1007/s00153-006-0012-4openalex-snapshot
Strong Enumeration Reducibilities
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.1016/j.tcs.2010.12.042openalex-snapshot
Splitting and nonsplitting in the Σ20 enumeration degrees
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80019-6openalex-snapshot
Reducibilities
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(96)00009-7openalex-snapshot
Cupping and noncupping in the enumeration degrees of ∑20 sets
inferred← citeshttps://doi.org/10.1017/9781316756140.006openalex-snapshot
Relative Splittings of in the-Enumeration Degrees
inferred← citeshttps://doi.org/10.1017/s0960129510000216openalex-snapshot
Diamond embeddings into the enumeration degrees
inferred← citeshttps://doi.org/10.1023/a:1022660222520openalex-snapshot
Splitting Properties of Total Enumeration Degrees
inferred← citeshttps://doi.org/10.1093/logcom/exq042openalex-snapshot
Embedding distributive lattices in the Formula enumeration degrees
inferred← citeshttps://doi.org/10.3233/com-180092openalex-snapshot
S. Barry Cooper (1943–2015)
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.