On the public citation graph

Onm - degrees of recursively enumerable sets

https://doi.org/10.1007/bf02219444
0 signed · 19 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.2307/1970028openalex-snapshot
On Degrees of Unsolvability
inferredcites →https://doi.org/10.2307/1970214openalex-snapshot
On the Degrees Less than 0 �
inferredcites →https://doi.org/10.2307/2269692openalex-snapshot
A note on universal 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.1002/malq.202100077openalex-snapshot
Rogers semilattices of limitwise monotonic numberings
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/bf00966536openalex-snapshot
The index sets of m-degrees
inferred← citeshttps://doi.org/10.1007/bf00967428openalex-snapshot
On incomparable enumerations
inferred← citeshttps://doi.org/10.1007/bf01673573openalex-snapshot
Structure of the upper semilattice of recursively enumerablem -degrees and related questions. I
inferred← citeshttps://doi.org/10.1007/bf01978382openalex-snapshot
Structural properties of computable classes of constructive models
inferred← citeshttps://doi.org/10.1007/bf01980608openalex-snapshot
Application of precomplete enumerations to tabular-type degrees and index sets
inferred← citeshttps://doi.org/10.1007/bf01985061openalex-snapshot
Upper semilattice of recursively enumerable sQ-degrees
inferred← citeshttps://doi.org/10.1007/bf02219292openalex-snapshot
The upper semilatticeL(γ)
inferred← citeshttps://doi.org/10.1007/bf02219842openalex-snapshot
On the cardinality of the upper semilattice of computable enumerations
inferred← citeshttps://doi.org/10.1007/s00153-021-00774-7openalex-snapshot
Degree structures of conjunctive reducibility
inferred← citeshttps://doi.org/10.1007/s001530000050openalex-snapshot
Every incomplete computably enumerable truth-table degree is branching
inferred← citeshttps://doi.org/10.1007/s00224-024-10165-zopenalex-snapshot
On Non-principal Arithmetical Numberings and Families
inferred← citeshttps://doi.org/10.1007/s10469-012-9161-1openalex-snapshot
Computably enumerable sets and related issues
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.