On the public citation graph

Initial segments and implications for the structure of degrees

https://doi.org/10.1007/bfb0059550
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.1002/malq.19680143002openalex-snapshot
Distributive Initial Segments of the Degrees of Unsolvability
inferredcites →https://doi.org/10.1016/s0049-237x(08)71931-1openalex-snapshot
Initial Segments of the Degrees of Unsolvability Part I: A Survey
inferredcites →https://doi.org/10.1112/plms/s3-19.1.1openalex-snapshot
Initial Segments of Turing Degrees
inferredcites →https://doi.org/10.2307/1970779openalex-snapshot
Initial Segments of the Degrees of Unsolvability
inferredcites →https://doi.org/10.2307/2269688openalex-snapshot
A theorem on minimal degrees
inferredcites →https://doi.org/10.2307/2270508openalex-snapshot
On initial segments of hyperdegrees
inferredcites →https://doi.org/10.2307/2270517openalex-snapshot
Initial segments of the degrees of unsolvability Part II: minimal degrees
inferredcites →https://doi.org/10.2307/2270693openalex-snapshot
The strong homogeneity conjecture
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/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferred← citeshttps://doi.org/10.1007/bf03007659openalex-snapshot
Fixed points of jump preserving automorphisms of degrees
inferred← citeshttps://doi.org/10.1007/bfb0059533openalex-snapshot
Conference in Mathematical Logic — London ’70
inferred← citeshttps://doi.org/10.1007/bfb0076230openalex-snapshot
Recursion theoretic aspects of the dual ramsey theorem
inferred← citeshttps://doi.org/10.1007/bfb0090953openalex-snapshot
The degrees of unsolvability: Global results
inferred← citeshttps://doi.org/10.1016/0003-4843(80)90004-2openalex-snapshot
Reducibility orderings: Theories, definability and automorphisms
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70025-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71117-0openalex-snapshot
Degrees of Unsolvability: A Survey of Results
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71260-6openalex-snapshot
Second order logic and first order theories of reducibility orderings*
inferred← citeshttps://doi.org/10.1017/9781316718254.005openalex-snapshot
Definability and global degree theory
inferred← citeshttps://doi.org/10.1017/s0305004100052221openalex-snapshot
Banach–Mazur games, comeager sets and degrees of unsolvability
inferred← citeshttps://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferred← citeshttps://doi.org/10.1090/s0273-0979-1990-15923-3openalex-snapshot
The jump is definable in the structure of the degrees of unsolvability
inferred← citeshttps://doi.org/10.2307/1971028openalex-snapshot
First-Order Theory of the Degrees of Recursive Unsolvability
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.