On the public citation graph
The upper semilatticeL(γ)
0 signed · 21 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/bf02218612openalex-snapshot
Recursively enumerable many-one degrees
inferredcites →https://doi.org/10.1007/bf02219047openalex-snapshot
On the Cartesian subalgebra of a free lie sum of Lie algebras
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
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.202100077openalex-snapshot
Rogers semilattices of limitwise monotonic numberings
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/bf00969237openalex-snapshot
Enumerations of canonically calculable families of finite sets
inferred← citeshttps://doi.org/10.1007/bf01152759openalex-snapshot
On the congruence of the upper semilattices of recursively enumerable m-powers and tabular powers
inferred← citeshttps://doi.org/10.1007/bf01462947openalex-snapshot
Segments of recursively enumerablem-degrees
inferred← citeshttps://doi.org/10.1007/bf01670110openalex-snapshot
Families of general recursive functions with a finite number of limit points
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/bf01673953openalex-snapshot
Several results on upper semilattices andm-degrees
inferred← citeshttps://doi.org/10.1007/s10469-012-9161-1openalex-snapshot
Computably enumerable sets and related issues
inferred← citeshttps://doi.org/10.1023/a:1016364016981openalex-snapshot
Minimal Coverings in the Rogers Semilattices of∑-Computable Numberings
inferred← citeshttps://doi.org/10.1070/rm1979v034n03abeh003988openalex-snapshot
REDUCIBILITIES OF TABULAR TYPE IN THE THEORY OF ALGORITHMS
inferred← citeshttps://doi.org/10.1070/rm2000v055n06abeh000354openalex-snapshot
Yuri Leonidovich Ershov (on his 60th birthday)
inferred← citeshttps://doi.org/10.1070/sm1977v032n04abeh002400openalex-snapshot
ON RECURSIVELY ENUMERABLE MINIMAL BTT-DEGREES
inferred← citeshttps://doi.org/10.1142/9789811278631_0004openalex-snapshot
Isomorphism Types of Rogers Semilattices in the Analytical Hierarchy
inferred← citeshttps://doi.org/10.26599/tst.2023.9010102openalex-snapshot
On Concept Lattices for Numberings
inferred← citeshttps://doi.org/10.48550/arxiv.2010.00830openalex-snapshot
Rogers semilattices in the analytical hierarchy: The case of finite families
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.