On the public citation graph

One class of partial sets

https://doi.org/10.1007/bf01098896
0 signed · 24 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/bf02219290openalex-snapshot
tt- andm-degrees
inferredcites →https://doi.org/10.1007/bf02219743openalex-snapshot
Two theorems on many-one degrees of recursively enumerable sets
inferredcites →https://doi.org/10.1090/s0002-9904-1944-08111-1openalex-snapshot
Recursively enumerable sets of positive integers and their decision problems
inferredcites →https://doi.org/10.1090/s0002-9947-1968-0220595-7openalex-snapshot
Semirecursive Sets and Positive Reducibility
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.1002/malq.200610017openalex-snapshot
Quasi‐completeness and functions without fixed‐points
inferred← citeshttps://doi.org/10.1007/bf01270394openalex-snapshot
Cappable recursively enumerable degrees and Post's program
inferred← citeshttps://doi.org/10.1007/s00153-012-0278-7openalex-snapshot
Q 1-degrees of c.e. sets
inferred← citeshttps://doi.org/10.1007/s00153-015-0451-xopenalex-snapshot
Some properties of r-maximal sets and Q 1,N -reducibility
inferred← citeshttps://doi.org/10.1007/s00153-022-00847-1openalex-snapshot
$$sQ_1$$-degrees of computably enumerable sets
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90146-zopenalex-snapshot
Twenty questions to a p-selector
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/j.apal.2008.06.003openalex-snapshot
Structural properties of Q -degrees of n-c. e. sets
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80023-8openalex-snapshot
An Overview of the Computably Enumerable Sets
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00114-2openalex-snapshot
Classes bounded by incomplete sets
inferred← citeshttps://doi.org/10.1017/9781316755921.008openalex-snapshot
Simple sets and ideals under m-reducibility
inferred← citeshttps://doi.org/10.1090/s0273-0979-1981-14863-1openalex-snapshot
Strong reducibilities
inferred← citeshttps://doi.org/10.1093/jigpal/jzaf072openalex-snapshot
On minimal pairs of quasi-degrees
inferred← citeshttps://doi.org/10.1093/jigpal/jzv023openalex-snapshot
Some properties of maximal sets
inferred← citeshttps://doi.org/10.1093/jigpal/jzx058openalex-snapshot
Some structural properties of quasi-degrees
inferred← citeshttps://doi.org/10.1093/logcom/exy036openalex-snapshot
On the connections between $wtt$- and $Q$-reducibilities
inferred← citeshttps://doi.org/10.1134/s0037446614060032openalex-snapshot
Q-reducibility and m-reducibility on computably enumerable sets
inferred← citeshttps://doi.org/10.1201/b21197-9openalex-snapshot
Peano Arithmetic Models and Computability
inferred← citeshttps://doi.org/10.1305/ndjfl/1187031408openalex-snapshot
Cuppability of Simple and Hypersimple Sets
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.