On the public citation graph

Recursive digraphs, splinters and cylinders

https://doi.org/10.1007/bf01342904
0 signed · 30 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.19550010205openalex-snapshot
Creative sets
inferredcites →https://doi.org/10.1002/malq.19570031202openalex-snapshot
[Russian Text Ignored]
inferredcites →https://doi.org/10.1007/bf01342903openalex-snapshot
The number of functional digraphs
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-9939-1953-0058533-7openalex-snapshot
Two Notes on Recursively Enumerable Sets
inferredcites →https://doi.org/10.1090/s0002-9947-1955-0067049-xopenalex-snapshot
Productive Sets
inferredcites →https://doi.org/10.2307/2002808openalex-snapshot
Computability and Unsolvability.
inferredcites →https://doi.org/10.4153/cjm-1958-035-xopenalex-snapshot
Retraceable 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.19670130106openalex-snapshot
On Pseudo‐Creative Sets, Splinters, and Bounded‐Truth‐Table Reducibility
inferred← citeshttps://doi.org/10.1002/malq.19670130602openalex-snapshot
Some Counterexamples in the Theory of Regressive Sets
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_73openalex-snapshot
Polynomial-time functions generate SAT: On P-splinters
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_71openalex-snapshot
Algorithms from complexity theory: Polynomial-time operations for complex sets
inferred← citeshttps://doi.org/10.1007/978-1-4612-4478-3_7openalex-snapshot
The Structure of Complete Degrees
inferred← citeshttps://doi.org/10.1007/bf01342903openalex-snapshot
The number of functional digraphs
inferred← citeshttps://doi.org/10.1016/0168-0072(92)90064-7openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90388-iopenalex-snapshot
On sets polynomially enumerable by iteration
inferred← citeshttps://doi.org/10.1016/s0022-0000(72)80005-9openalex-snapshot
Combinatorial systems I. Cylindrical problems
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70025-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71951-7openalex-snapshot
Combinatorial Systems II, Non-Cylindrical Problems
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00272-3openalex-snapshot
Learning algebraic structures from text
inferred← citeshttps://doi.org/10.1090/s0002-9939-1964-0179079-9openalex-snapshot
On Reducibility by Recursive Functions
inferred← citeshttps://doi.org/10.1090/s0002-9947-1962-0140406-2openalex-snapshot
Constructive Analogues of the Group of Permutations of the Natural Numbers
inferred← citeshttps://doi.org/10.1090/s0002-9947-1965-0209151-1openalex-snapshot
On Semi-Cylinders, Splinters, and Bounded-Truth-Table Reducibility
inferred← citeshttps://doi.org/10.1090/s0002-9947-1969-0242667-4openalex-snapshot
Recursive theory and Dedekind cuts
inferred← citeshttps://doi.org/10.1305/ndjfl/1093891701openalex-snapshot
The general decision problem for Markov algorithms with axiom.
inferred← citeshttps://doi.org/10.2140/pjm.1964.14.749openalex-snapshot
A note on pseudo-creative sets and cylinders
inferred← citeshttps://doi.org/10.2140/pjm.1969.29.351openalex-snapshot
Initial segments of one-one degrees
inferred← citeshttps://doi.org/10.2307/2270621openalex-snapshot
Linear orderings under one-one reducibility
inferred← citeshttps://doi.org/10.2307/2271363openalex-snapshot
An unsolved problem in the theory of constructive order types
inferred← citeshttps://doi.org/10.48550/arxiv.1612.05136openalex-snapshot
On permutations with decidable cycles
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.