On the public citation graph

Π10 classes, strong minimal covers and hyperimmune-free degrees

0 signed · 26 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/978-3-662-21755-9openalex-snapshot
Degrees of Unsolvability
inferredcites →https://doi.org/10.1007/s00153-006-0004-4openalex-snapshot
Arithmetical Sacks Forcing
inferredcites →https://doi.org/10.1007/s001530050068openalex-snapshot
Rank, join, and Cantor singletons
inferredcites →https://doi.org/10.1016/0168-0072(90)90020-3openalex-snapshot
Minimal degrees recursive in 1-generic degrees
inferredcites →https://doi.org/10.1017/cbo9780511629167.005openalex-snapshot
Array nonrecursive degrees and genericity
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1090/s0002-9939-08-09345-3openalex-snapshot
On a question of Slaman and Groszek
inferredcites →https://doi.org/10.1090/s0002-9947-1979-0539912-0openalex-snapshot
Generic sets and minimal 𝛼-degrees
inferredcites →https://doi.org/10.1112/blms/bdm074openalex-snapshot
A random degree with strong minimal cover
inferredcites →https://doi.org/10.1112/jlms/jdp049openalex-snapshot
A fixed-point-free minimal degree
inferredcites →https://doi.org/10.1515/9783110807486.81openalex-snapshot
Weak recursive degrees and a problem of Spector
inferredcites →https://doi.org/10.2307/2695101openalex-snapshot
Computational randomness and lowness

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-642-21875-0_2openalex-snapshot
Three Theorems on n-REA Degrees: Proof-Readers and Verifiers
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.011openalex-snapshot
Strong minimal covers and a question of Yates: The story so far
inferred← citeshttps://doi.org/10.1090/s0002-9939-2012-11183-9openalex-snapshot
Measure and cupping in the Turing degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-10-05037-3openalex-snapshot
On the degree spectrum of a $\Pi ^0_1$ class
inferred← citeshttps://doi.org/10.1093/logcom/exq047openalex-snapshot
Properties of the jump classes
inferred← citeshttps://doi.org/10.1112/blms/bdm074openalex-snapshot
A random degree with strong minimal cover
inferred← citeshttps://doi.org/10.1112/jlms/jdp049openalex-snapshot
A fixed-point-free minimal degree
inferred← citeshttps://doi.org/10.1134/s1995080221040041openalex-snapshot
Fixed-point Selection Functions
inferred← citeshttps://doi.org/10.1215/00294527-2010-028openalex-snapshot
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree
inferred← citeshttps://doi.org/10.2178/jsl.7803180openalex-snapshot
Low Level Nondelegability Results: Domination and Recursive Enumeration
inferred← citeshttps://doi.org/10.2178/jsl/1327068689openalex-snapshot
Array nonrecursiveness and relative recursive enumerability
inferred← citeshttps://doi.org/10.3233/com-170068openalex-snapshot
The search for natural definability in the Turing degrees
inferred← citeshttps://doi.org/10.48550/arxiv.1111.1064openalex-snapshot
The typical Turing degree
inferred← citeshttps://doi.org/10.48550/arxiv.1806.09368openalex-snapshot
Minimal bounds and members of effectively closed 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.