On the public citation graph
Structure of powers of generalized index sets
0 signed · 22 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/bf01673946openalex-snapshot
Structures of the degrees of unsolvability of index sets
inferredcites →https://doi.org/10.1007/bf02321892openalex-snapshot
Complete numerations with infinitely many singular elements
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.19880340208openalex-snapshot
Strong Reducibilities of Enumerations and Partial Enumerated Algebras
inferred← citeshttps://doi.org/10.1002/malq.19880340310openalex-snapshot
Binary Relations Over the Category of Enumerated Sets
inferred← citeshttps://doi.org/10.1002/malq.200710011openalex-snapshot
Hierarchies of Δ02‐measurable k ‐partitions
inferred← citeshttps://doi.org/10.1007/978-3-030-30229-0_10openalex-snapshot
Well-Quasi Orders and Hierarchy Theory
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/bf01978879openalex-snapshot
Hierearchies of hyperarithmetical sets and functions
inferred← citeshttps://doi.org/10.1007/bf01979197openalex-snapshot
Generalized semilattices and m-degrees of index sets
inferred← citeshttps://doi.org/10.1007/s10469-007-0006-2openalex-snapshot
Distributive lattices of numberings
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/s10469-010-9084-7openalex-snapshot
Definability of closure operations in the h-quasiorder of labeled forests
inferred← citeshttps://doi.org/10.1016/j.apal.2008.09.026openalex-snapshot
Definability in the h -quasiorder of labeled forests
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.1023/b:allo.0000015130.31054.b3openalex-snapshot
Boolean Hierarchies of Partitions over a Reducible Base
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.