On the public citation graph

Enumerations of families of general recursive functions

0 signed · 47 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.1002/malq.19690150712openalex-snapshot

Strong enumeration properties of recursively enumerable classes

inferredcites →https://doi.org/10.1007/bf01040653openalex-snapshot

Enumeration 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/bf02219821openalex-snapshot

On computable enumerations

inferredcites →https://doi.org/10.1007/bf02330746openalex-snapshot

The computable enumerations of families of general recursive functions

inferredcites →https://doi.org/10.2307/2270617openalex-snapshot

On the indexing of classes of recursively enumerable sets

inferredcites →https://doi.org/10.2307/2316720openalex-snapshot

Theory of Recursive Functions and Effective Computability.

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.19840300904openalex-snapshot

CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS

inferred← citeshttps://doi.org/10.1002/malq.200310013openalex-snapshot

Topological aspects of numberings

inferred← citeshttps://doi.org/10.1006/inco.2001.2922openalex-snapshot

Learning by the Process of Elimination

inferred← citeshttps://doi.org/10.1007/3-540-58140-5_14openalex-snapshot

Classes with pairwise equivalent enumerations

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/3-540-61863-5_49openalex-snapshot

Learning by erasing

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/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/bf01668593openalex-snapshot

Computable enumerations of families of general recursive functions

inferred← citeshttps://doi.org/10.1007/bf01669456openalex-snapshot

The quantity of nonautoequivalent constructivizations

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/bf01792984openalex-snapshot

Some applications of computable one-one numberings

inferred← citeshttps://doi.org/10.1007/bf02367027openalex-snapshot

An autostable 1-decidable model without a computable Scott family of ∃-formulas

inferred← citeshttps://doi.org/10.1007/bf02684082openalex-snapshot

Families with one-element Rogers semilattice

inferred← citeshttps://doi.org/10.1007/bfb0026301openalex-snapshot

Numberings of R1∪F

inferred← citeshttps://doi.org/10.1007/s00153-005-0326-7openalex-snapshot

A computably stable structure with no Scott family of finitary formulas

inferred← citeshttps://doi.org/10.1007/s10469-015-9333-xopenalex-snapshot

Preserving Categoricity and Complexity of Relations

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/0168-0072(93)90231-2openalex-snapshot

Stability among r.e. quotient algebras

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.2005.10.002openalex-snapshot

Effective categoricity of equivalence structures

inferred← citeshttps://doi.org/10.1016/j.apal.2008.11.003openalex-snapshot

Effective categoricity of Abelian p -groups

inferred← citeshttps://doi.org/10.1016/j.apal.2019.01.003openalex-snapshot

Computability-theoretic categoricity and Scott families

inferred← citeshttps://doi.org/10.1016/s0049-237x(00)80022-1openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00059-6openalex-snapshot

Computable isomorphisms, degree spectra of relations, and Scott families

inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00269-8openalex-snapshot

Learning languages and functions by erasing

inferred← citeshttps://doi.org/10.1017/cbo9780511565670.009openalex-snapshot

Effective Model Theory: The Number of Models and Their Complexity

inferred← citeshttps://doi.org/10.1017/cbo9781107338579.006openalex-snapshot

Computable model theory

inferred← citeshttps://doi.org/10.1017/jsl.2019.26openalex-snapshot

AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES

inferred← citeshttps://doi.org/10.1017/jsl.2026.10186openalex-snapshot

COMPUTABLE $\Pi _2$ SCOTT SENTENCES

inferred← citeshttps://doi.org/10.1070/rm2000v055n06abeh000354openalex-snapshot

Yuri Leonidovich Ershov (on his 60th birthday)

inferred← citeshttps://doi.org/10.1070/sm1981v040n02abeh001797openalex-snapshot

ON REDUCIBILITIES OF NUMERATIONS

inferred← citeshttps://doi.org/10.1134/s0037446621010031openalex-snapshot

On Universal Pairs in the Ershov Hierarchy

inferred← citeshttps://doi.org/10.1142/s0219061318500101openalex-snapshot

There is no classification of the decidably presentable structures

inferred← citeshttps://doi.org/10.2178/jsl/1245158098openalex-snapshot

Intrinsic bounds on complexity and definability at limit levels

inferred← citeshttps://doi.org/10.48550/arxiv.0805.1887openalex-snapshot

Effective categoricity of equivalence Structures

inferred← citeshttps://doi.org/10.48550/arxiv.0805.1889openalex-snapshot

Effective categoricity of Abelian p-groups

inferred← citeshttps://doi.org/10.55452/1998-6688-2023-20-1-14-20openalex-snapshot

ON THE EXISTENCE OF UNIVERSAL 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.