On the public citation graph

On some examples of upper semilattices of computable enumerations

https://doi.org/10.1007/bf02218587
0 signed · 21 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-58140-5_14openalex-snapshot
Classes with pairwise equivalent enumerations
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-1-4615-0755-0_4openalex-snapshot
Isomorphism Types and Theories of Rogers Semilattices of Arithmetical Numberings
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/bf01877237openalex-snapshot
Enumerations of families of general recursive functions
inferred← citeshttps://doi.org/10.1007/bf02260929openalex-snapshot
Effective choice operations on constructive and positive models
inferred← citeshttps://doi.org/10.1007/bf02671950openalex-snapshot
A description of autostable models
inferred← citeshttps://doi.org/10.1007/s00153-018-0647-yopenalex-snapshot
Elementary theories and hereditary undecidability for semilattices of numberings
inferred← citeshttps://doi.org/10.1007/s10469-014-9290-9openalex-snapshot
Families Without Minimal Numberings
inferred← citeshttps://doi.org/10.1007/s10469-015-9340-yopenalex-snapshot
Ideals Without Minimal Elements in Rogers Semilattices
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.1023/a:1025971406116openalex-snapshot
Uniformity in Computable Structure Theory
inferred← citeshttps://doi.org/10.1134/s0037446617060192openalex-snapshot
The Rogers Semilattices of Generalized Computable Enumerations
inferred← citeshttps://doi.org/10.1134/s1995080221040065openalex-snapshot
Theories of Rogers Semilattices of Analytical Numberings
inferred← citeshttps://doi.org/10.1142/9789811278631_0004openalex-snapshot
Isomorphism Types of Rogers Semilattices in the Analytical Hierarchy
inferred← citeshttps://doi.org/10.2178/bsl/1264433799openalex-snapshot
2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09
inferred← citeshttps://doi.org/10.26599/tst.2023.9010102openalex-snapshot
On Concept Lattices for Numberings
inferred← citeshttps://doi.org/10.3103/s0027132223030026openalex-snapshot
Two Theorems on Minimal Generalized Computable Numberings
inferred← citeshttps://doi.org/10.48550/arxiv.2010.00830openalex-snapshot
Rogers semilattices in the analytical hierarchy: The case of finite 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.