On the public citation graph

On inseparable pairs

https://doi.org/10.1007/bf02219043
0 signed · 20 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.19700160208openalex-snapshot
Some Properties of Recursively Inseparable Sets
inferredcites →https://doi.org/10.1007/bf02219655openalex-snapshot
On nonprincipal enumerations
inferredcites →https://doi.org/10.2307/2269692openalex-snapshot
A note on universal sets

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_2openalex-snapshot
Completeness and Universality of Arithmetical Numberings
inferred← citeshttps://doi.org/10.1007/bf01673946openalex-snapshot
Structures of the degrees of unsolvability of index sets
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-024-10165-zopenalex-snapshot
On Non-principal Arithmetical Numberings and Families
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/s11202-008-0076-yopenalex-snapshot
Some remarks on completion 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.1017/s0960129526100541openalex-snapshot
Relative completeness of arithmetical numberings
inferred← citeshttps://doi.org/10.1093/logcom/exad023openalex-snapshot
Effective inseparability and some applications in meta-mathematics
inferred← citeshttps://doi.org/10.1093/logcom/exad074openalex-snapshot
Fixed point theorems for minimal numberings
inferred← citeshttps://doi.org/10.1134/s000143462409013xopenalex-snapshot
On $$e$$-Principal and $$e$$-Complete 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.2307/2273476openalex-snapshot
Kleene index sets and functional m-degrees
inferred← citeshttps://doi.org/10.3233/com-210387openalex-snapshot
Numberings, c.e. oracles, and fixed points
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.