On the public citation graph

Structures of the degrees of unsolvability of index sets

https://doi.org/10.1007/bf01673946
0 signed · 23 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/bf02218733openalex-snapshot
Index sets in0′
inferredcites →https://doi.org/10.1007/bf02219043openalex-snapshot
On inseparable pairs
inferredcites →https://doi.org/10.2307/2269692openalex-snapshot
A note on universal sets
inferredcites →https://doi.org/10.2307/2272557openalex-snapshot
A discrete chain of degrees of index sets
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.1007/bf00968988openalex-snapshot
Index sets in the hyperarithmetical hierarchy
inferred← citeshttps://doi.org/10.1007/bf01219086openalex-snapshot
On linear and quadratic Jordan division algebras
inferred← citeshttps://doi.org/10.1007/bf01669494openalex-snapshot
Structure of the m-degrees of the index sets of families of partial recursive functions
inferred← citeshttps://doi.org/10.1007/bf01978567openalex-snapshot
Index sets of quotient objects of the post numeration
inferred← citeshttps://doi.org/10.1007/bf01978831openalex-snapshot
Generalized semilattices and m-degrees of index sets. II
inferred← citeshttps://doi.org/10.1007/bf01979197openalex-snapshot
Generalized semilattices and m-degrees of index sets
inferred← citeshttps://doi.org/10.1007/bf01980638openalex-snapshot
Structure of powers of generalized index sets
inferred← citeshttps://doi.org/10.1007/s10469-007-0011-5openalex-snapshot
The quotient algebra of labeled forests modulo h-equivalence
inferred← citeshttps://doi.org/10.1007/s10958-021-05422-2openalex-snapshot
Precomplete Numberings
inferred← citeshttps://doi.org/10.1007/s11856-024-2650-9openalex-snapshot
New central elements in free alternative algebras
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.042openalex-snapshot
Variations on Wadge Reducibility Extended Abstract
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.008openalex-snapshot
On the Wadge Reducibility of k-Partitions
inferred← citeshttps://doi.org/10.1016/j.jlap.2009.02.008openalex-snapshot
On the Wadge reducibility of k -partitions
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.053openalex-snapshot
Towards a descriptive set theory for domain-like structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.06.031openalex-snapshot
Fine hierarchies and m-reducibilities in theoretical computer science
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80030-5openalex-snapshot
Theory of Numberings
inferred← citeshttps://doi.org/10.2140/pjm.2011.251.23openalex-snapshot
Unital quadratic quasi-Jordan algebras
inferred← citeshttps://doi.org/10.2307/2273476openalex-snapshot
Kleene index sets and functional m-degrees
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.