On the public citation graph

The computable enumerations of families of general recursive functions

https://doi.org/10.1007/bf02330746
0 signed · 28 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.1007/bf02219842openalex-snapshot
On the cardinality of the upper semilattice of computable enumerations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-46769-6_22openalex-snapshot
Learnability of Enumerable Classes of Recursive Functions from “Typical” Examples
inferred← citeshttps://doi.org/10.1007/3-540-58520-6_57openalex-snapshot
Co-learnability and FIN-identifiability of enumerable classes of total recursive functions
inferred← citeshttps://doi.org/10.1007/978-1-4615-0755-0_4openalex-snapshot
Isomorphism Types and Theories of Rogers Semilattices of Arithmetical Numberings
inferred← citeshttps://doi.org/10.1007/bf00739994openalex-snapshot
Discrete families of recursive functions and index sets
inferred← citeshttps://doi.org/10.1007/bf00750228openalex-snapshot
Minimal numerations of positively computable families
inferred← citeshttps://doi.org/10.1007/bf00967370openalex-snapshot
Some remarks about classes of recursively enumerable sets
inferred← citeshttps://doi.org/10.1007/bf00967428openalex-snapshot
On incomparable enumerations
inferred← citeshttps://doi.org/10.1007/bf00969237openalex-snapshot
Enumerations of canonically calculable families of finite sets
inferred← citeshttps://doi.org/10.1007/bf01668593openalex-snapshot
Computable enumerations of families of general recursive functions
inferred← citeshttps://doi.org/10.1007/bf01669607openalex-snapshot
Computable single-valued numerations
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/bf01875946openalex-snapshot
Two theorems on computable numberings
inferred← citeshttps://doi.org/10.1007/bf01877237openalex-snapshot
Enumerations of families of general recursive functions
inferred← citeshttps://doi.org/10.1007/bf01982111openalex-snapshot
Positive numerations of families with one-valued numerations
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/s11202-008-0024-xopenalex-snapshot
e-Principal numberings
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.1016/j.apal.2005.02.001openalex-snapshot
Enumerations in computable structure theory
inferred← citeshttps://doi.org/10.1134/s0037446624020125openalex-snapshot
A Family with a Single Minimal but Not Least Numbering
inferred← citeshttps://doi.org/10.1145/1111037.1111053openalex-snapshot
Adventures in time and space
inferred← citeshttps://doi.org/10.17150/2500-2759.2017.27(4).585-593openalex-snapshot
Полурешетки Роджерса классов бесконечных вычислимых множеств
inferred← citeshttps://doi.org/10.2178/bsl/1185803808openalex-snapshot
2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06
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.26907/2949-3919.2026.1.47-66openalex-snapshot
Computable covers for arithmetical collections of programming systems
inferred← citeshttps://doi.org/10.3103/s1066369x25700306openalex-snapshot
On Infinite Direct Sums of Minimal Numberings of Functional Families
inferred← citeshttps://doi.org/10.33048/semi.2021.18.035openalex-snapshot
Weak reducibility of computable and generalized computable numberings
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.