On the public citation graph

Index sets of quotient objects of the post numeration

https://doi.org/10.1007/bf01978567
0 signed · 28 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.19660120125openalex-snapshot
Classes of Recursively Enumerable Sets and Degrees of Unsolvability
inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bf01669494openalex-snapshot
Structure of the m-degrees of the index sets of families of partial recursive functions
inferredcites →https://doi.org/10.1007/bf01673946openalex-snapshot
Structures of the degrees of unsolvability of index sets
inferredcites →https://doi.org/10.1007/bf01978879openalex-snapshot
Hierearchies of hyperarithmetical sets and functions
inferredcites →https://doi.org/10.1007/bf01980638openalex-snapshot
Structure of powers of generalized index sets
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.2307/2274268openalex-snapshot
A hierarchy of families of recursively enumerable degrees

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.202200035openalex-snapshot
Extremal numberings and fixed point theorems
inferred← citeshttps://doi.org/10.1007/978-1-4615-0755-0_14openalex-snapshot
Positive Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-61716-4_14openalex-snapshot
Fixed Point Theorems in Computability Theory
inferred← citeshttps://doi.org/10.1007/bf01229443openalex-snapshot
Precomplete numberings and functions without fixed points
inferred← citeshttps://doi.org/10.1007/bf01980251openalex-snapshot
Refined hierarchy of formulas
inferred← citeshttps://doi.org/10.1007/bf02018741openalex-snapshot
Fine hierarchy and definable index sets
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/0168-0072(94)00050-6openalex-snapshot
On recursively enumerable structures
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.tcs.2022.04.054openalex-snapshot
Partial combinatory algebra and generalized numberings
inferred← citeshttps://doi.org/10.1017/bsl.2020.46openalex-snapshot
COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS
inferred← citeshttps://doi.org/10.1017/s0960129516000438openalex-snapshot
Complexity for partial computable functions over computable Polish spaces
inferred← citeshttps://doi.org/10.1017/s0960129526100541openalex-snapshot
Relative completeness of arithmetical numberings
inferred← citeshttps://doi.org/10.1093/logcom/exad074openalex-snapshot
Fixed point theorems for minimal numberings
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.1142/s0129054125500248openalex-snapshot
Recursion Theorems in Numbered Sets
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.26907/2949-3919.2026.1.47-66openalex-snapshot
Computable covers for arithmetical collections of programming systems
inferred← citeshttps://doi.org/10.31219/osf.io/tmg9sopenalex-snapshot
Fixed point properties of numbered families
inferred← citeshttps://doi.org/10.3233/com-210344openalex-snapshot
Fixpoints and relative precompleteness
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.