On the public citation graph
Computable single-valued numerations
0 signed · 56 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.1002/malq.19640100802openalex-snapshot
A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION
inferredcites →https://doi.org/10.1007/bf02219834openalex-snapshot
On the reducibility of computable numerations
inferredcites →https://doi.org/10.1007/bf02306734openalex-snapshot
Two existence theorems for computable numerations
inferredcites →https://doi.org/10.1007/bf02330746openalex-snapshot
The computable enumerations of families of general recursive functions
inferredcites →https://doi.org/10.1090/s0002-9939-1964-0174479-5openalex-snapshot
Gödel numberings versus Friedberg numberings
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.2307/2964290openalex-snapshot
Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
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.201200045openalex-snapshot
On the existence of universal numberings for finite families of d.c.e. sets
inferred← citeshttps://doi.org/10.1002/malq.202200035openalex-snapshot
Extremal numberings and fixed point theorems
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_2openalex-snapshot
Computability and Numberings
inferred← citeshttps://doi.org/10.1007/978-0-387-69245-6_3openalex-snapshot
Computability and Computable Models
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-030-22996-2_9openalex-snapshot
Bounded Reducibility for Computable Numberings
inferred← citeshttps://doi.org/10.1007/978-3-030-59267-7_1openalex-snapshot
Semilattices of Punctual Numberings
inferred← citeshttps://doi.org/10.1007/bf00739415openalex-snapshot
Computable classes of constructivizations for models of infinite algorithmic dimension
inferred← citeshttps://doi.org/10.1007/bf01054216openalex-snapshot
Nilpotent groups of finite algorithmic dimension
inferred← citeshttps://doi.org/10.1007/bf01669323openalex-snapshot
Problem of the number of non-self-equivalent constructivizations
inferred← citeshttps://doi.org/10.1007/bf01792984openalex-snapshot
Some applications of computable one-one numberings
inferred← citeshttps://doi.org/10.1007/bf01978382openalex-snapshot
Structural properties of computable classes of constructive models
inferred← citeshttps://doi.org/10.1007/bf01982111openalex-snapshot
Positive numerations of families with one-valued numerations
inferred← citeshttps://doi.org/10.1007/bf01988314openalex-snapshot
Nonuniform autostability of models
inferred← citeshttps://doi.org/10.1007/bf02259949openalex-snapshot
Algorithmic dimensions of homomorphic images of models
inferred← citeshttps://doi.org/10.1007/s00153-014-0402-yopenalex-snapshot
Friedberg numberings in the Ershov hierarchy
inferred← citeshttps://doi.org/10.1007/s00153-024-00914-9openalex-snapshot
On computable numberings of families of Turing degrees
inferred← citeshttps://doi.org/10.1007/s10469-018-9499-0openalex-snapshot
Some Absolute Properties of A-Computable Numberings
inferred← citeshttps://doi.org/10.1007/s10469-019-09546-yopenalex-snapshot
Turing Degrees of Complete Formulas of Almost Prime Models
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/s10958-016-2851-9openalex-snapshot
Boolean Algebras with Distinguished Endomorphisms and Generating Trees
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90097-6openalex-snapshot
Some effects of Ash–Nerode and other decidability conditions on degree spectra
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90190-oopenalex-snapshot
The possible turing degree of the nonzero member in a two element degree spectrum
inferred← citeshttps://doi.org/10.1016/j.apal.2005.02.001openalex-snapshot
Enumerations in computable structure theory
inferred← citeshttps://doi.org/10.1016/j.apal.2019.102716openalex-snapshot
Reductions between types of numberings
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80002-5openalex-snapshot
Chapter 1 Pure computable model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80007-4openalex-snapshot
Chapter 6 Autostable models and algorithmic dimensions
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80012-8openalex-snapshot
Chapter 11 A bibliography of recursive algebra and recursive model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80028-7openalex-snapshot
Computable Rings and Fields
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00094-xopenalex-snapshot
Degree spectra of relations on structures of finite computable dimension
inferred← citeshttps://doi.org/10.1023/a:1015352513117openalex-snapshot
Friedberg Numberings of Families of n-Computably Enumerable Sets
inferred← citeshttps://doi.org/10.1134/s0037446621010031openalex-snapshot
On Universal Pairs in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1134/s0037446624020125openalex-snapshot
A Family with a Single Minimal but Not Least Numbering
inferred← citeshttps://doi.org/10.1134/s1995080217040035openalex-snapshot
Effective categoricity for distributive lattices and Heyting algebras
inferred← citeshttps://doi.org/10.1142/9789811278631_0004openalex-snapshot
Isomorphism Types of Rogers Semilattices in the Analytical Hierarchy
inferred← citeshttps://doi.org/10.1215/00294527-10670074openalex-snapshot
A Local Version of the Slaman–Wehner Theorem and Families Closed Under Finite Differences
inferred← citeshttps://doi.org/10.17150/2500-2759.2017.27(4).585-593openalex-snapshot
Полурешетки Роджерса классов бесконечных вычислимых множеств
inferred← citeshttps://doi.org/10.2178/jsl/1067620182openalex-snapshot
A computably categorical structure whose expansion by a constant has infinite computable dimension
inferred← citeshttps://doi.org/10.2178/jsl/1231082315openalex-snapshot
Prime models of finite computable dimension
inferred← citeshttps://doi.org/10.2178/jsl/1243948330openalex-snapshot
A decomposition of the Rogers semilattice of a family of d.c.e. sets
inferred← citeshttps://doi.org/10.2307/2695024openalex-snapshot
Degree spectra of intrinsically c.e. relations
inferred← citeshttps://doi.org/10.2307/420948openalex-snapshot
European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2307/421207openalex-snapshot
Degree Spectra of Relations on Computable Structures
inferred← citeshttps://doi.org/10.3103/s0027132223030026openalex-snapshot
Two Theorems on Minimal Generalized Computable Numberings
inferred← citeshttps://doi.org/10.3233/com-210387openalex-snapshot
Numberings, c.e. oracles, and fixed points
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.