On the public citation graph

Enumeration of families of general recursive functions

https://doi.org/10.1007/bf01040653
0 signed · 29 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1515/9781400881840openalex-snapshot
Degrees of Unsolvability. (AM-55)
inferredcites →https://doi.org/10.2307/2314466openalex-snapshot
Degrees of Unsolvability.
inferredcites →https://doi.org/10.2748/tmj/1178244403openalex-snapshot
An enumeration of the primitive recursive functions without repetition

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-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/978-3-031-34827-3_8openalex-snapshot
Program-Closed Categories: Computability as a Property
inferred← citeshttps://doi.org/10.1007/bf00971395openalex-snapshot
On cardinality of semilattices of enumerations of nondiscrete families
inferred← citeshttps://doi.org/10.1007/bf01159198openalex-snapshot
Families of general recursive functions without isolated points
inferred← citeshttps://doi.org/10.1007/bf01668593openalex-snapshot
Computable enumerations of families of general recursive functions
inferred← citeshttps://doi.org/10.1007/bf01877237openalex-snapshot
Enumerations of families of general recursive functions
inferred← citeshttps://doi.org/10.1007/bf02219821openalex-snapshot
On computable enumerations
inferred← citeshttps://doi.org/10.1007/bf02219842openalex-snapshot
On the cardinality of the upper semilattice of computable enumerations
inferred← citeshttps://doi.org/10.1007/bf02684082openalex-snapshot
Families with one-element Rogers semilattice
inferred← citeshttps://doi.org/10.1007/s00153-014-0402-yopenalex-snapshot
Friedberg numberings in the Ershov hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-015-9340-yopenalex-snapshot
Ideals Without Minimal Elements in Rogers Semilattices
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/j.ic.2025.105354openalex-snapshot
On cardinalities of Rogers semilattices for families in the Ershov hierarchy
inferred← citeshttps://doi.org/10.1017/s0960129522000093openalex-snapshot
Rogers semilattices of punctual numberings
inferred← citeshttps://doi.org/10.1023/a:1015304629955openalex-snapshot
Evaluating the Complexity of Index Sets for Families of General Recursive Functions in the Arithmetic Hierarchy
inferred← citeshttps://doi.org/10.1134/s000143462409013xopenalex-snapshot
On $$e$$-Principal and $$e$$-Complete Numberings
inferred← citeshttps://doi.org/10.1134/s0037446617060192openalex-snapshot
The Rogers Semilattices of Generalized Computable Enumerations
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/s1055134422040010openalex-snapshot
On Numberings for Classes of Families of Total Functions
inferred← citeshttps://doi.org/10.26907/0021-3446-2025-4-38-52openalex-snapshot
On infinite direct sums of minimal numberings of functional families
inferred← citeshttps://doi.org/10.3103/s0027132223030026openalex-snapshot
Two Theorems on Minimal Generalized Computable Numberings
inferred← citeshttps://doi.org/10.3103/s1066369x25700306openalex-snapshot
On Infinite Direct Sums of Minimal Numberings of Functional 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.