On the public citation graph

Two theorems on computable numberings

https://doi.org/10.1007/bf01875946
0 signed · 27 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/bf01462949openalex-snapshot
Certain properties of post enumeration retracts
inferredcites →https://doi.org/10.1007/bf02219785openalex-snapshot
Hyper-hypersimplem-degrees
inferredcites →https://doi.org/10.1007/bf02330746openalex-snapshot
The computable enumerations of families of general recursive functions
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.202100077openalex-snapshot
Rogers semilattices of limitwise monotonic numberings
inferred← citeshttps://doi.org/10.1007/11750321_66openalex-snapshot
On Rogers Semilattices
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/bf00971395openalex-snapshot
On cardinality of semilattices of enumerations of nondiscrete families
inferred← citeshttps://doi.org/10.1007/bf01982111openalex-snapshot
Positive numerations of families with one-valued numerations
inferred← citeshttps://doi.org/10.1007/bf02104845openalex-snapshot
A generalization of selivanov's theorem
inferred← citeshttps://doi.org/10.1007/bf02679757openalex-snapshot
Completely recursively enumerable sets
inferred← citeshttps://doi.org/10.1007/bf02684082openalex-snapshot
Families with one-element Rogers semilattice
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-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.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)80030-5openalex-snapshot
Theory of Numberings
inferred← citeshttps://doi.org/10.1017/s0960129522000093openalex-snapshot
Rogers semilattices of punctual 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.1142/9789811278631_0004openalex-snapshot
Isomorphism Types of Rogers Semilattices in the Analytical Hierarchy
inferred← citeshttps://doi.org/10.26599/tst.2023.9010102openalex-snapshot
On Concept Lattices for Numberings
inferred← citeshttps://doi.org/10.48550/arxiv.2010.00830openalex-snapshot
Rogers semilattices in the analytical hierarchy: The case of finite families
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.