On the public citation graph
Recursively enumerable many-one degrees
0 signed · 41 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.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.19940400407openalex-snapshot
Recursively Enumerable Equivalence Relations Modulo Finite Differences
inferred← citeshttps://doi.org/10.1002/malq.200920043openalex-snapshot
Low sets without subsets of higher many-one degree
inferred← citeshttps://doi.org/10.1002/malq.201020063openalex-snapshot
On Σ11 equivalence relations over the natural numbers
inferred← citeshttps://doi.org/10.1007/978-1-4615-0755-0_3openalex-snapshot
Algebraic Properties of Rogers Semilattices of Arithmetical Numberings
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_53openalex-snapshot
Upper Semilattices in Many-One Degrees
inferred← citeshttps://doi.org/10.1007/978-3-662-21571-5_42openalex-snapshot
Hanna Neumann’s Problems on Varieties of Groups
inferred← citeshttps://doi.org/10.1007/bf00739571openalex-snapshot
The last question on recursively enumerablem-degrees
inferred← citeshttps://doi.org/10.1007/bf01158034openalex-snapshot
Algorithmic complexity of algebraic systems
inferred← citeshttps://doi.org/10.1007/bf01190967openalex-snapshot
Undecidable fragments of elementary theories
inferred← citeshttps://doi.org/10.1007/bf01462947openalex-snapshot
Segments of recursively enumerablem-degrees
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/bf02018741openalex-snapshot
Fine hierarchy and definable index sets
inferred← citeshttps://doi.org/10.1007/bfb0065196openalex-snapshot
Hanna Neumann's problems on varieties of groups
inferred← citeshttps://doi.org/10.1007/bfb0086118openalex-snapshot
A direct construction of a minimal recursively enumerable truth-table degree
inferred← citeshttps://doi.org/10.1007/s10469-005-0010-3openalex-snapshot
Local structure of Rogers semilattices of Σn 0-computable numberings
inferred← citeshttps://doi.org/10.1007/s10469-006-0004-9openalex-snapshot
Rogers Semilattices of Finite Partially Ordered Sets
inferred← citeshttps://doi.org/10.1007/s10469-007-0016-0openalex-snapshot
The universal Lachlan semilattice without the greatest element
inferred← citeshttps://doi.org/10.1007/s10469-012-9161-1openalex-snapshot
Computably enumerable sets and related issues
inferred← citeshttps://doi.org/10.1007/s10469-026-09812-wopenalex-snapshot
On the Number of Minimal Elements of Ideals of Rogers Semilattices
inferred← citeshttps://doi.org/10.1007/s11202-006-0045-2openalex-snapshot
On the definition of a Lachlan semilattice
inferred← citeshttps://doi.org/10.1007/s11202-008-0076-yopenalex-snapshot
Some remarks on completion of numberings
inferred← citeshttps://doi.org/10.1016/0168-0072(94)00050-6openalex-snapshot
On recursively enumerable structures
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80046-7openalex-snapshot
Rigidity and definability in the noncomputable universe
inferred← citeshttps://doi.org/10.1023/a:1012516217265openalex-snapshot
Rogers Semilattices of Families of Arithmetic Sets
inferred← citeshttps://doi.org/10.1023/a:1023354407888openalex-snapshot
Initial Segments in Rogers Semilattices of $$\Sigma _n^0 $$ -Computable Numberings
inferred← citeshttps://doi.org/10.1070/rm1979v034n03abeh003988openalex-snapshot
REDUCIBILITIES OF TABULAR TYPE IN THE THEORY OF ALGORITHMS
inferred← citeshttps://doi.org/10.1090/memo/1284openalex-snapshot
Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees
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/s0273-0979-1981-14863-1openalex-snapshot
Strong reducibilities
inferred← citeshttps://doi.org/10.2307/2274468openalex-snapshot
Undecidability and initial segments of the (r.e.) tt-degrees
inferred← citeshttps://doi.org/10.2307/2275423openalex-snapshot
Annual meeting of the Association for Symbolic Logic, Notre Dame, 1993
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.2307/420949openalex-snapshot
1994 Annual Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.3103/s1055134407030029openalex-snapshot
Numbered distributive semilattices
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.