On the public citation graph

Generalized computable numerations and nontrivial rogers semilattices

https://doi.org/10.1007/bf02671553
0 signed · 104 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/bf01976264openalex-snapshot
Recursively enumerable classes and their application to recursive sequences of formal theories
inferredcites →https://doi.org/10.1007/bf02219842openalex-snapshot
On the cardinality of the upper semilattice of computable enumerations
inferredcites →https://doi.org/10.1016/0168-0072(93)90076-popenalex-snapshot
Some effectively infinite classes of enumerations
inferredcites →https://doi.org/10.1090/s0002-9939-1964-0174479-5openalex-snapshot
Gödel numberings versus Friedberg numberings
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.2307/2964290openalex-snapshot
Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
inferredcites →https://doi.org/10.2307/2964292openalex-snapshot
Gödel numberings of partial recursive functions

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.201100114openalex-snapshot
Rogers semilattices of families of two embedded sets in the Ershov hierarchy
inferred← citeshttps://doi.org/10.1002/malq.202100077openalex-snapshot
Rogers semilattices of limitwise monotonic numberings
inferred← citeshttps://doi.org/10.1002/malq.202200035openalex-snapshot
Extremal numberings and fixed point theorems
inferred← citeshttps://doi.org/10.1007/11750321_66openalex-snapshot
On Rogers Semilattices
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_2openalex-snapshot
Computability and 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_2openalex-snapshot
Completeness and Universality of Arithmetical Numberings
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/978-3-031-20350-3_8openalex-snapshot
On Two Types of Concept Lattices in the Theory of Numberings
inferred← citeshttps://doi.org/10.1007/978-3-031-64309-5_11openalex-snapshot
On Arithmetical Numberings in Reverse Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_13openalex-snapshot
Characterizing Programming Systems Allowing Program Self-reference
inferred← citeshttps://doi.org/10.1007/s00153-014-0402-yopenalex-snapshot
Friedberg numberings in the Ershov hierarchy
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/s00153-022-00842-6openalex-snapshot
Complexity of $$\Sigma ^0_n$$-classifications for definable subsets
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/s00224-009-9168-8openalex-snapshot
Characterizing Programming Systems Allowing Program Self-Reference
inferred← citeshttps://doi.org/10.1007/s00224-024-10165-zopenalex-snapshot
On Non-principal Arithmetical Numberings and Families
inferred← citeshttps://doi.org/10.1007/s10469-005-0010-3openalex-snapshot
Local structure of Rogers semilattices of Σn 0-computable numberings
inferred← citeshttps://doi.org/10.1007/s10469-005-0016-xopenalex-snapshot
Elementary Theories for Rogers Semilattices
inferred← citeshttps://doi.org/10.1007/s10469-006-0034-3openalex-snapshot
Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-012-9162-0openalex-snapshot
Positive undecidable numberings in the Ershov hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-014-9290-9openalex-snapshot
Families Without Minimal Numberings
inferred← citeshttps://doi.org/10.1007/s10469-014-9296-3openalex-snapshot
Generalized Computable Universal Numberings
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-015-9349-2openalex-snapshot
Friedberg Numberings in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-016-9390-9openalex-snapshot
Embeddability of the Semilattice L m 0 in Rogers Semilattices
inferred← citeshttps://doi.org/10.1007/s10469-017-9454-5openalex-snapshot
Universal Generalized Computable Numberings and Hyperimmunity
inferred← citeshttps://doi.org/10.1007/s10469-018-9499-0openalex-snapshot
Some Absolute Properties of A-Computable Numberings
inferred← citeshttps://doi.org/10.1007/s10469-018-9503-8openalex-snapshot
Positive Presentations of Families in Relation to Reducibility with Respect to Enumerability
inferred← citeshttps://doi.org/10.1007/s10469-019-09538-yopenalex-snapshot
Weakly Precomplete Equivalence Relations in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-019-09540-4openalex-snapshot
Computable Numberings of Families of Infinite Sets
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-020-09578-9openalex-snapshot
Computable Positive and Friedberg Numberings in Hyperarithmetic
inferred← citeshttps://doi.org/10.1007/s10469-020-09613-9openalex-snapshot
Numberings in the Analytical Hierarchy
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-09688-6openalex-snapshot
Minimal Generalized Computable Numberings and Families of Positive Preorders
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-09812-wopenalex-snapshot
On the Number of Minimal Elements of Ideals of Rogers Semilattices
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.1007/s10849-025-09430-2openalex-snapshot
A Family Whose Computable Numberings are All Complete
inferred← citeshttps://doi.org/10.1007/s10958-012-1140-5openalex-snapshot
Properties of numberings in various levels of the Ershov hierarchy
inferred← citeshttps://doi.org/10.1007/s10958-012-1141-4openalex-snapshot
Infinite family of $$ \Sigma_a^{-1 } $$ -sets with a unique computable numbering
inferred← citeshttps://doi.org/10.1007/s10958-016-2857-3openalex-snapshot
Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings
inferred← citeshttps://doi.org/10.1007/s10958-020-04781-6openalex-snapshot
On One-to-One Numberings of the Family of All $$ {\Sigma}_2^1 $$-Sets
inferred← citeshttps://doi.org/10.1007/s11202-006-0045-2openalex-snapshot
On the definition of a Lachlan semilattice
inferred← citeshttps://doi.org/10.1016/j.apal.2019.102716openalex-snapshot
Reductions between types of numberings
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103523openalex-snapshot
Some properties of precompletely and positively numbered sets
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.1017/s0960129526100541openalex-snapshot
Relative completeness of arithmetical numberings
inferred← citeshttps://doi.org/10.1023/a:1012516217265openalex-snapshot
Rogers Semilattices of Families of Arithmetic Sets
inferred← citeshttps://doi.org/10.1023/a:1015352513117openalex-snapshot
Friedberg Numberings of Families of n-Computably Enumerable Sets
inferred← citeshttps://doi.org/10.1023/a:1023354407888openalex-snapshot
Initial Segments in Rogers Semilattices of $$\Sigma _n^0 $$ -Computable Numberings
inferred← citeshttps://doi.org/10.1023/b:allo.0000004175.64588.32openalex-snapshot
Positive Numberings of Families of Sets in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1063/1.4959720openalex-snapshot
Hyperimmunity and A-computable universal numberings
inferred← citeshttps://doi.org/10.1093/jigpal/jzag040openalex-snapshot
Computably enumerable sets of reals in constructive mathematical analysis
inferred← citeshttps://doi.org/10.1093/logcom/exad074openalex-snapshot
Fixed point theorems for minimal 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/s000143462409013xopenalex-snapshot
On $$e$$-Principal and $$e$$-Complete Numberings
inferred← citeshttps://doi.org/10.1134/s0037446617030181openalex-snapshot
Minimal generalized computable enumerations and high degrees
inferred← citeshttps://doi.org/10.1134/s0037446617060192openalex-snapshot
The Rogers Semilattices of Generalized Computable Enumerations
inferred← citeshttps://doi.org/10.1134/s0037446618040079openalex-snapshot
Positive Presentations of Families Relative to e-Oracles
inferred← citeshttps://doi.org/10.1134/s0037446619020046openalex-snapshot
Rogers Semilattices for Families of Equivalence Relations in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1134/s003744662003009xopenalex-snapshot
Positive Numberings in Admissible Sets
inferred← citeshttps://doi.org/10.1134/s0037446621010031openalex-snapshot
On Universal Pairs in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1134/s0037446622020148openalex-snapshot
On $ p $-Universal and $ p $-Minimal Numberings
inferred← citeshttps://doi.org/10.1134/s0037446623010172openalex-snapshot
Enumeration Reducibility and Positive Reducibility of the Numberings of Families of Arithmetic Sets
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/s0037446624020125openalex-snapshot
A Family with a Single Minimal but Not Least Numbering
inferred← citeshttps://doi.org/10.1134/s0037446625020144openalex-snapshot
An Approach to the Classification of Minimal Numberings of Families of Arithmetical Sets
inferred← citeshttps://doi.org/10.1134/s1055134422040010openalex-snapshot
On Numberings for Classes of Families of Total Functions
inferred← citeshttps://doi.org/10.1134/s1055134423030057openalex-snapshot
Positive Reducibilities, Extreme Numberings, and Completeness
inferred← citeshttps://doi.org/10.1134/s1995080217040035openalex-snapshot
Effective categoricity for distributive lattices and Heyting algebras
inferred← citeshttps://doi.org/10.1134/s1995080221040065openalex-snapshot
Theories of Rogers Semilattices of Analytical Numberings
inferred← citeshttps://doi.org/10.1134/s1995080225606125openalex-snapshot
Notes on Classes of Minimal Numberings of Arithmetical Set Families
inferred← citeshttps://doi.org/10.1142/9789811278631_0004openalex-snapshot
Isomorphism Types of Rogers Semilattices in the Analytical Hierarchy
inferred← citeshttps://doi.org/10.1142/s1793557122502187openalex-snapshot
One note on positive A-computable numberings
inferred← citeshttps://doi.org/10.1215/00294527-10670074openalex-snapshot
A Local Version of the Slaman–Wehner Theorem and Families Closed Under Finite Differences
inferred← citeshttps://doi.org/10.17150/2500-2759.2017.27(4).585-593openalex-snapshot
Полурешетки Роджерса классов бесконечных вычислимых множеств
inferred← citeshttps://doi.org/10.20944/preprints202312.1276.v1openalex-snapshot
Withdrawn: Fixed Point Properties of Precompletely and Positively Numbered Sets
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.26907/0021-3446-2026-5-87-92openalex-snapshot
Complete Numberings of Families of Sets of Computable Reals
inferred← citeshttps://doi.org/10.26907/2949-3919.2024.1.94-108openalex-snapshot
Some properties of classes of minimal numberings of arithmetical set 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/s0027132223030026openalex-snapshot
Two Theorems on Minimal Generalized Computable Numberings
inferred← citeshttps://doi.org/10.3103/s1066369x16120112openalex-snapshot
Universal computable enumerations of finite classes of families of total functions
inferred← citeshttps://doi.org/10.3103/s1066369x23050031openalex-snapshot
Effectively Infinite Classes of Numberings of Computable Families of Reals
inferred← citeshttps://doi.org/10.31219/osf.io/tmg9sopenalex-snapshot
Fixed point properties of numbered families
inferred← citeshttps://doi.org/10.3233/com-210387openalex-snapshot
Numberings, c.e. oracles, and fixed points
inferred← citeshttps://doi.org/10.3233/com-230461openalex-snapshot
Effectively infinite classes of numberings and computable families of reals
inferred← citeshttps://doi.org/10.33048/semi.2021.18.035openalex-snapshot
Weak reducibility of computable and generalized computable 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.