On the public citation graph

Contiguous R.E. Degrees

https://doi.org/10.1007/bfb0099477
0 signed · 30 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.1002/malq.19710170131openalex-snapshot
Sublattices of the Recursively Enumerable Degrees
inferredcites →https://doi.org/10.1007/bfb0059544openalex-snapshot
Embedding nondistributive lattices in the recursively enumerable degrees
inferredcites →https://doi.org/10.1016/0003-4843(75)90007-8openalex-snapshot
The weak truth table degrees of recursively enumerable sets
inferredcites →https://doi.org/10.1090/s0002-9947-1973-0398805-7openalex-snapshot
A Completely Mitotic Nonrecursive R.E. Degree
inferredcites →https://doi.org/10.1090/s0002-9947-1982-0664035-xopenalex-snapshot
Branching Degrees above low 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/plms/s3-16.1.537openalex-snapshot
Lower Bounds for Pairs of Recursively Enumerable Degrees
inferredcites →https://doi.org/10.2307/1970776openalex-snapshot
Interpolation and Embedding in the Recursively Enumerable Degrees
inferredcites →https://doi.org/10.2307/2273300openalex-snapshot
Bounding minimal pairs

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.19850312903openalex-snapshot
Anti‐Mitotic Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.1002/malq.19890350102openalex-snapshot
Embedding Lattices with Top Preserved Below Non‐GL2 Degrees
inferred← citeshttps://doi.org/10.1002/malq.19890350411openalex-snapshot
A Contiguous Nonbranching Degree
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_2openalex-snapshot
Embedding Distributive Lattices Preserving 1 below a Nonzero Recursively Enumerable Turing Degree
inferred← citeshttps://doi.org/10.1007/978-3-030-22996-2_24openalex-snapshot
The d.r.e wtt-Degrees are Dense
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_28openalex-snapshot
There Are No Maximal d.c.e. wtt-degrees
inferred← citeshttps://doi.org/10.1007/bf02007561openalex-snapshot
Cupping and noncapping in the r.e. weak truth table and turing degrees
inferred← citeshttps://doi.org/10.1007/bf02017497openalex-snapshot
Localization of a theorem of Ambos-Spies and the strong anti-splitting property
inferred← citeshttps://doi.org/10.1007/bfb0076212openalex-snapshot
Generators of the recursively enumerable degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90071-0openalex-snapshot
Structural interactions of the recursively enumerable T- and W-degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(89)90005-5openalex-snapshot
Intervals and sublattices of the R.E. weak truth table degrees, part I: Density
inferred← citeshttps://doi.org/10.1016/0168-0072(90)90062-7openalex-snapshot
Lattice nonembeddings and initial segments of the recursively enumerable degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90234-5openalex-snapshot
Splitting theorems in recursion theory
inferred← citeshttps://doi.org/10.1017/s0022481200027961openalex-snapshot
Degree theoretical splitting properties of recursively enumerable sets
inferred← citeshttps://doi.org/10.1090/s0002-9947-1987-0879565-xopenalex-snapshot
T-Degrees, Jump Classes, and Strong Reducibilities
inferred← citeshttps://doi.org/10.1090/s0002-9947-1987-0891641-4openalex-snapshot
Degrees of splittings and bases of recursively enumerable subspaces
inferred← citeshttps://doi.org/10.1215/00294527-2009-022openalex-snapshot
On the Degrees of Diagonal Sets and the Failure of the Analogue of a Theorem of Martin
inferred← citeshttps://doi.org/10.1305/ndjfl/1039700747openalex-snapshot
Infima in the Recursively Enumerable Weak Truth Table Degrees
inferred← citeshttps://doi.org/10.2178/jsl/1190150052openalex-snapshot
Maximal contiguous degrees
inferred← citeshttps://doi.org/10.2307/2275877openalex-snapshot
The undecidability of the Π4-theory for the r.e. wtt and Turing degrees
inferred← citeshttps://doi.org/10.3233/com-180088openalex-snapshot
Automorphism bases for the recursively enumerable 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.