On the public citation graph
Structure of the upper semilattice of recursively enumerablem -degrees and related questions. I
0 signed · 25 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.1007/bf01462947openalex-snapshot
Segments of recursively enumerablem-degrees
inferredcites →https://doi.org/10.1007/bf01668550openalex-snapshot
The upper semilattice of numerations of a finite set
inferredcites →https://doi.org/10.1007/bf01668551openalex-snapshot
Supplement to Yu. L. Ershov's article "The upper semilattice of numerations of a finite set"
inferredcites →https://doi.org/10.1007/bf02218612openalex-snapshot
Recursively enumerable many-one degrees
inferredcites →https://doi.org/10.1007/bf02219444openalex-snapshot
Onm - degrees of recursively enumerable sets
inferredcites →https://doi.org/10.1007/bf02219743openalex-snapshot
Two theorems on many-one degrees of recursively enumerable sets
inferredcites →https://doi.org/10.1090/s0002-9904-1944-08111-1openalex-snapshot
Recursively enumerable sets of positive integers and their decision problems
inferredcites →https://doi.org/10.4153/cjm-1970-010-6openalex-snapshot
Initial Segments of Many-One Degrees
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.201020063openalex-snapshot
On Σ11 equivalence relations over the natural numbers
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/bf00739571openalex-snapshot
The last question on recursively enumerablem-degrees
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/s11202-006-0045-2openalex-snapshot
On the definition of a Lachlan semilattice
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90027-2openalex-snapshot
The structure of the honest polynomial m-degrees
inferred← citeshttps://doi.org/10.1023/a:1025005309632openalex-snapshot
Necessary Isomorphism Conditions for Rogers Semilattices of Finite Partially Ordered Sets
inferred← citeshttps://doi.org/10.2307/2275423openalex-snapshot
Annual meeting of the Association for Symbolic Logic, Notre Dame, 1993
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.