On the public citation graph
The upper semilattice of numerations of a finite set
0 signed · 23 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.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.1007/978-3-319-50062-1_35openalex-snapshot
Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees
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/bf01668551openalex-snapshot
Supplement to Yu. L. Ershov's article "The upper semilattice of numerations of a finite set"
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/s10469-012-9161-1openalex-snapshot
Computably enumerable sets and related issues
inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.012openalex-snapshot
Empty intervals in the enumeration degrees
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80046-7openalex-snapshot
Rigidity and definability in the noncomputable universe
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80020-2openalex-snapshot
Local Degree Theory* *Preparation of this paper partially supported by E.P.S.R.C. research grants nos. GR/H91213 and GR/H02165, and by EC Human Capital and Mobility network ‘Complexity, Logic and Recursion Theory’.
inferred← citeshttps://doi.org/10.1017/bsl.2018.15openalex-snapshot
PERMUTATIONS OF THE INTEGERS INDUCE ONLY THE TRIVIAL AUTOMORPHISM OF THE TURING DEGREES
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.1070/rm2000v055n06abeh000354openalex-snapshot
Yuri Leonidovich Ershov (on his 60th birthday)
inferred← citeshttps://doi.org/10.1090/s0273-0979-1981-14863-1openalex-snapshot
Strong reducibilities
inferred← citeshttps://doi.org/10.1134/s0037446621010031openalex-snapshot
On Universal Pairs in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1142/9789811278631_0004openalex-snapshot
Isomorphism Types of Rogers Semilattices in the Analytical Hierarchy
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/2275790openalex-snapshot
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices
inferred← citeshttps://doi.org/10.5281/zenodo.188226openalex-snapshot
FIGURES 71–78 in A taxonomic study of the Indian species of Euops Schoenherr (Coleoptera: Curculionoidea: Attelabidae)
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.