On the public citation graph
A theorem on minimal degrees
0 signed · 44 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1073/pnas.43.2.236openalex-snapshot
TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
inferredcites →https://doi.org/10.2307/1969708openalex-snapshot
The Upper Semi-Lattice of Degrees of Recursive Unsolvability
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.19690150707openalex-snapshot
The degrees of bi‐immune sets
inferred← citeshttps://doi.org/10.1002/malq.19740200804openalex-snapshot
Minimal Degrees in Generalized Recursion Theory
inferred← citeshttps://doi.org/10.1002/malq.200410027openalex-snapshot
Properly ?2 minimal degrees and 0? complementation
inferred← citeshttps://doi.org/10.1002/malq.200410044openalex-snapshot
The minimal complementation property above 0′
inferred← citeshttps://doi.org/10.1007/bfb0059550openalex-snapshot
Initial segments and implications for the structure of degrees
inferred← citeshttps://doi.org/10.1007/bfb0086114openalex-snapshot
Enumeration reducibility, nondeterministic computations and relative computability of partial functions
inferred← citeshttps://doi.org/10.1007/bfb0086118openalex-snapshot
A direct construction of a minimal recursively enumerable truth-table degree
inferred← citeshttps://doi.org/10.1007/s001530050063openalex-snapshot
Conjectures and questions from Gerald Sacks's Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/0003-4843(72)90011-3openalex-snapshot
Degrees of unsolvability complementary between recursively enumerable degrees, Part 1
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90039-xopenalex-snapshot
Complementing below recursively enumerable degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90096-vopenalex-snapshot
Generic degrees are complemented
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71511-8openalex-snapshot
Recursively Enumerable Degrees and the Degrees Less Than 0(1)
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71931-1openalex-snapshot
Initial Segments of the Degrees of Unsolvability Part I: A Survey
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80020-2openalex-snapshot
Local Degree Theory* *Preparation of this paper partially supported by E.P.S.R.C. research grants nos. GR/H91213 and GR/H02165, and by EC Human Capital and Mobility network ‘Complexity, Logic and Recursion Theory’.
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.1023/a:1021400820931openalex-snapshot
Embedding of Countable Orders in Turing Degrees
inferred← citeshttps://doi.org/10.1090/s0002-9939-1973-0311467-5openalex-snapshot
A minimal partial degree ≤𝑂^{’}
inferred← citeshttps://doi.org/10.1090/s0002-9947-1972-0316227-0openalex-snapshot
Π⁰₁ classes and degrees of theories
inferred← citeshttps://doi.org/10.1112/jlms/jdp049openalex-snapshot
A fixed-point-free minimal degree
inferred← citeshttps://doi.org/10.1201/b21197-9openalex-snapshot
Peano Arithmetic Models and Computability
inferred← citeshttps://doi.org/10.2178/jsl/1102022208openalex-snapshot
Minimal complements for degrees below 0′
inferred← citeshttps://doi.org/10.2178/jsl/1183743753openalex-snapshot
Relative Recursive Enumerability of Generic Degrees
inferred← citeshttps://doi.org/10.2307/2270517openalex-snapshot
Initial segments of the degrees of unsolvability Part II: minimal degrees
inferred← citeshttps://doi.org/10.2307/2271724openalex-snapshot
Minimal α-recursion theoretic degrees
inferred← citeshttps://doi.org/10.2307/2272061openalex-snapshot
Minimal degrees and the jump operator
inferred← citeshttps://doi.org/10.2307/2272899openalex-snapshot
A minimal degree not realizing least possible jump
inferred← citeshttps://doi.org/10.2307/2275334openalex-snapshot
Every n-generic degree is a minimal cover of an n-generic degree
inferred← citeshttps://doi.org/10.2307/2586653openalex-snapshot
Bounding minimal degrees by computably enumerable degrees
inferred← citeshttps://doi.org/10.2307/2586706openalex-snapshot
A 1-generic degree with a strong minimal cover
inferred← citeshttps://doi.org/10.2307/2695042openalex-snapshot
On the structures inside truth-table degrees
inferred← citeshttps://doi.org/10.3233/com-170068openalex-snapshot
The search for natural definability in the Turing degrees
inferred← citeshttps://doi.org/10.4213/mzm456openalex-snapshot
О вложении счетных порядков в тьюринговые степени
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.