On the public citation graph
On the cardinality of the upper semilattice of computable enumerations
0 signed · 37 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/bf02219444openalex-snapshot
Onm - degrees of recursively enumerable sets
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-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/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/bf01978382openalex-snapshot
Structural properties of computable classes of constructive models
inferred← citeshttps://doi.org/10.1007/bf01978387openalex-snapshot
Local classes and computable indexations
inferred← citeshttps://doi.org/10.1007/bf02218587openalex-snapshot
On some examples of upper semilattices of computable enumerations
inferred← citeshttps://doi.org/10.1007/bf02330746openalex-snapshot
The computable enumerations of families of general recursive functions
inferred← citeshttps://doi.org/10.1007/bf02671553openalex-snapshot
Generalized computable numerations and nontrivial rogers semilattices
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-014-9290-9openalex-snapshot
Families Without Minimal Numberings
inferred← citeshttps://doi.org/10.1007/s10469-019-09557-9openalex-snapshot
Khutoretskii’s Theorem for Generalized Computable Families
inferred← citeshttps://doi.org/10.1007/s10469-021-09653-9openalex-snapshot
One-Element Rogers Semilattices in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-022-09690-yopenalex-snapshot
Rogers Semilattices with Least and Greatest Elements in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-026-09832-6openalex-snapshot
One Property of Complete Numberings of Computable and Generalized Computable Families
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.1134/s0001434623050127openalex-snapshot
On the Embedding of the First Nonconstructive Ordinal in the Rogers Semilattices
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/s0037446623040146openalex-snapshot
Embedding of the First Nonconstructive Ordinal into the Rogers Semilattices of Families of Arithmetic Sets
inferred← citeshttps://doi.org/10.1134/s1055134422040010openalex-snapshot
On Numberings for Classes of Families of Total Functions
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/1243948330openalex-snapshot
A decomposition of the Rogers semilattice of a family of d.c.e. sets
inferred← citeshttps://doi.org/10.26599/tst.2023.9010102openalex-snapshot
On Concept Lattices for Numberings
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.31489/2024m4/31-40openalex-snapshot
Punctual numberings for families of sets
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.