On the public citation graph
Computable enumerations of families of general recursive functions
0 signed · 35 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/bf01040653openalex-snapshot
Enumeration of families of general recursive functions
inferredcites →https://doi.org/10.1007/bf01877237openalex-snapshot
Enumerations of families of general recursive functions
inferredcites →https://doi.org/10.1007/bf02218587openalex-snapshot
On some examples of upper semilattices of computable enumerations
inferredcites →https://doi.org/10.1007/bf02330746openalex-snapshot
The computable enumerations of families of general recursive functions
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.200310013openalex-snapshot
Topological aspects of numberings
inferred← citeshttps://doi.org/10.1007/3-540-58140-5_14openalex-snapshot
Classes with pairwise equivalent enumerations
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/bf00739994openalex-snapshot
Discrete families of recursive functions and index sets
inferred← citeshttps://doi.org/10.1007/bf00971395openalex-snapshot
On cardinality of semilattices of enumerations of nondiscrete families
inferred← citeshttps://doi.org/10.1007/bf02684082openalex-snapshot
Families with one-element Rogers semilattice
inferred← citeshttps://doi.org/10.1007/s10469-015-9333-xopenalex-snapshot
Preserving Categoricity and Complexity of Relations
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-021-09653-9openalex-snapshot
One-Element Rogers Semilattices in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00036-copenalex-snapshot
A learning-theoretic characterization of classes of recursive functions
inferred← citeshttps://doi.org/10.1017/9781108525749.004openalex-snapshot
Existentially-Atomic Models
inferred← citeshttps://doi.org/10.1017/9781108525749.007openalex-snapshot
Comparing Structures and Classes of Structures
inferred← citeshttps://doi.org/10.1017/9781108525749.008openalex-snapshot
Finite-Injury Constructions
inferred← citeshttps://doi.org/10.1017/jsl.2026.10186openalex-snapshot
COMPUTABLE $\Pi _2$ SCOTT SENTENCES
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.2178/jsl/1245158098openalex-snapshot
Intrinsic bounds on complexity and definability at limit levels
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.