On the public citation graph

A criterion for completeness of degrees of unsolvability

0 signed · 108 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.1090/s0002-9947-1955-0070594-4openalex-snapshot
Arithmetical Predicates and Function Quantifiers
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.19710170139openalex-snapshot
Arithmetical Reducibilities I
inferred← citeshttps://doi.org/10.1002/malq.19740201302openalex-snapshot
Relativized Halting Problems
inferred← citeshttps://doi.org/10.1002/malq.19740201311openalex-snapshot
Maximal Arithmetical Reducibilities
inferred← citeshttps://doi.org/10.1002/malq.19960420116openalex-snapshot
Strong Minimal Covers for Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.1002/malq.19990450413openalex-snapshot
About Segment Complexity of Turing Reductions
inferred← citeshttps://doi.org/10.1007/978-3-031-08740-0_20openalex-snapshot
ON TREES WITHOUT HYPERIMMUNE BRANCHES
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_22openalex-snapshot
Turing Jumps Through Provability
inferred← citeshttps://doi.org/10.1007/978-3-319-43669-2_2openalex-snapshot
Ivan Soskov: A Life in Computability
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_13openalex-snapshot
Weakly Represented Families in Reverse Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_15openalex-snapshot
Pseudojump Operators and $\Pi^0_1$ Classes
inferred← citeshttps://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferred← citeshttps://doi.org/10.1007/bf01275466openalex-snapshot
The rhombus classes of degrees of unsolvability (I), The jump properties
inferred← citeshttps://doi.org/10.1007/bf01987834openalex-snapshot
Untersuchungen über die Struktur des Kleene-Postschen Halbverbandes der Grade der Rekursiven Unlösbarkeit
inferred← citeshttps://doi.org/10.1007/bf02218733openalex-snapshot
Index sets in0′
inferred← citeshttps://doi.org/10.1007/bf03007659openalex-snapshot
Fixed points of jump preserving automorphisms of degrees
inferred← citeshttps://doi.org/10.1007/bfb0090953openalex-snapshot
The degrees of unsolvability: Global results
inferred← citeshttps://doi.org/10.1007/bfb0099479openalex-snapshot
Minimal degrees and 1-generic sets below 0′
inferred← citeshttps://doi.org/10.1007/s00153-012-0310-yopenalex-snapshot
Antibasis theorems for $${\Pi^0_1}$$ classes and the jump hierarchy
inferred← citeshttps://doi.org/10.1007/s00224-017-9798-1openalex-snapshot
On the Uniform Computational Content of Computability Theory
inferred← citeshttps://doi.org/10.1007/s11856-016-1433-3openalex-snapshot
The weakness of being cohesive, thin or free in reverse mathematics
inferred← citeshttps://doi.org/10.1016/0003-4843(76)90023-1openalex-snapshot
A degree-theoretic definition of the ramified analytical hierarchy
inferred← citeshttps://doi.org/10.1016/0003-4843(80)90004-2openalex-snapshot
Reducibility orderings: Theories, definability and automorphisms
inferred← citeshttps://doi.org/10.1016/0168-0072(88)90034-6openalex-snapshot
A non-inversion theorem for the jump operator
inferred← citeshttps://doi.org/10.1016/b978-0-12-386980-7.50002-2openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem – A Correction
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/b978-0-7204-2233-7.50054-xopenalex-snapshot
A BIBLIOGRAPHY OF THE THEORY OF MODELS
inferred← citeshttps://doi.org/10.1016/j.apal.2004.06.008openalex-snapshot
Completely mitotic c.e. degrees and non-jump inversion
inferred← citeshttps://doi.org/10.1016/j.apal.2014.04.002openalex-snapshot
A reducibility related to being hyperimmune-free
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.1016/s0049-237x(09)70009-6openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/9781108525749openalex-snapshot
Computable Structure Theory
inferred← citeshttps://doi.org/10.1017/9781108525749.001openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1017/9781108525749.002openalex-snapshot
Structures
inferred← citeshttps://doi.org/10.1017/9781108525749.003openalex-snapshot
Relations
inferred← citeshttps://doi.org/10.1017/9781108525749.004openalex-snapshot
Existentially-Atomic Models
inferred← citeshttps://doi.org/10.1017/9781108525749.005openalex-snapshot
Generic Presentations
inferred← citeshttps://doi.org/10.1017/9781108525749.006openalex-snapshot
Degree Spectra
inferred← citeshttps://doi.org/10.1017/9781108525749.007openalex-snapshot
Comparing Structures and Classes of Structures
inferred← citeshttps://doi.org/10.1017/9781108525749.008openalex-snapshot
Finite-Injury Constructions
inferred← citeshttps://doi.org/10.1017/9781108525749.009openalex-snapshot
Computable Categoricity
inferred← citeshttps://doi.org/10.1017/9781108525749.010openalex-snapshot
The Jump of A Structure
inferred← citeshttps://doi.org/10.1017/9781108525749.011openalex-snapshot
Σ-Small Classes
inferred← citeshttps://doi.org/10.1017/9781108525749.012openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/9781108525749.013openalex-snapshot
Index
inferred← citeshttps://doi.org/10.1017/9781316717301openalex-snapshot
Higher Recursion Theory
inferred← citeshttps://doi.org/10.1017/9781316718254.005openalex-snapshot
Definability and global degree theory
inferred← citeshttps://doi.org/10.1017/9781316755884.016openalex-snapshot
Aspects of the Turing jump
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.012openalex-snapshot
Embeddings into the Turing degrees
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.005openalex-snapshot
Computability theory, algorithmic randomness and Turing's anticipation
inferred← citeshttps://doi.org/10.1017/jsl.2016.34openalex-snapshot
ON THE NON-ENUMERABILITY OF L
inferred← citeshttps://doi.org/10.1017/jsl.2021.96openalex-snapshot
HTP-COMPLETE RINGS OF RATIONAL NUMBERS
inferred← citeshttps://doi.org/10.1017/s0960129506005603openalex-snapshot
Restricted jump interpolation in the d.c.e. degrees
inferred← citeshttps://doi.org/10.1090/conm/257/04040openalex-snapshot
Natural definability in degree structures
inferred← citeshttps://doi.org/10.1090/jams/848openalex-snapshot
Defining totality in the enumeration degrees
inferred← citeshttps://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferred← citeshttps://doi.org/10.1090/s0002-9939-05-07901-3openalex-snapshot
A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
inferred← citeshttps://doi.org/10.1090/s0002-9939-1970-0265154-xopenalex-snapshot
Minimal Covers and Arithmetical Sets
inferred← citeshttps://doi.org/10.1090/s0002-9939-1984-0728361-5openalex-snapshot
The jump inversion theorem for 𝑄_{2𝑛+1}-degrees
inferred← citeshttps://doi.org/10.1090/s0002-9939-1988-0938684-6openalex-snapshot
Two Theorems on Truth Table Degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-1963-0155747-3openalex-snapshot
Recursive enumerability and the jump operator
inferred← citeshttps://doi.org/10.1090/s0002-9947-1972-0316227-0openalex-snapshot
Π⁰₁ classes and degrees of theories
inferred← citeshttps://doi.org/10.1090/s0002-9947-1973-0319730-3openalex-snapshot
Sets of formulas valid in finite structures
inferred← citeshttps://doi.org/10.1090/s0002-9947-1983-0682720-1openalex-snapshot
Pseudo Jump Operators. I: The R. E. Case
inferred← citeshttps://doi.org/10.1090/s0002-9947-1983-0697077-xopenalex-snapshot
Inverting the Half-Jump
inferred← citeshttps://doi.org/10.1090/s0894-0347-08-00604-8openalex-snapshot
On the orbits of computably enumerable sets
inferred← citeshttps://doi.org/10.1090/tran/7621openalex-snapshot
On the structure of the Wadge degrees of bqo-valued Borel functions
inferred← citeshttps://doi.org/10.1093/logcom/exn028openalex-snapshot
Pseudojumps and Formula Classes
inferred← citeshttps://doi.org/10.1109/sct.1995.514732openalex-snapshot
Inverting the Turing jump in complexity theory
inferred← citeshttps://doi.org/10.1134/s1995080226617157openalex-snapshot
Weak Jumps in the Elementary Degrees and Jump Inversion Theorems
inferred← citeshttps://doi.org/10.1142/9789812794055_0002openalex-snapshot
GLOBAL PROPERTIES OF THE TURING DEGREES AND THE TURING JUMP
inferred← citeshttps://doi.org/10.1142/s0219061316500021openalex-snapshot
On notions of computability-theoretic reduction between Π21 principles
inferred← citeshttps://doi.org/10.1142/s021906132050021xopenalex-snapshot
Turing degrees in Polish spaces and decomposability of Borel functions
inferred← citeshttps://doi.org/10.1201/b21197-9openalex-snapshot
Peano Arithmetic Models and Computability
inferred← citeshttps://doi.org/10.1215/00294527-2009-020openalex-snapshot
Superhighness
inferred← citeshttps://doi.org/10.1305/ndjfl/1040136917openalex-snapshot
On the Strength of Ramsey's Theorem
inferred← citeshttps://doi.org/10.1305/ndjfl/1093888120openalex-snapshot
Degrees of unsolvability and strong forms of $\Lambda_R+\Lambda_R\not\subseteq \Lambda_R$.
inferred← citeshttps://doi.org/10.2140/pjm.1984.115.409openalex-snapshot
Density of a final segment of the truth-table degrees
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:16)2015openalex-snapshot
Partial functions and domination
inferred← citeshttps://doi.org/10.2178/bsl/1208358844openalex-snapshot
The Complexity of Orbits of Computably Enumerable Sets
inferred← citeshttps://doi.org/10.2178/jsl.7803180openalex-snapshot
Low Level Nondelegability Results: Domination and Recursive Enumeration
inferred← citeshttps://doi.org/10.2178/jsl/1102022219openalex-snapshot
Generalized high degrees have the complementation property
inferred← citeshttps://doi.org/10.2178/jsl/1305810761openalex-snapshot
Jump inversions inside effectively closed sets and applications to randomness
inferred← citeshttps://doi.org/10.2178/jsl/1318338849openalex-snapshot
Limits on jump inversion for strong reducibilities
inferred← citeshttps://doi.org/10.2307/1971028openalex-snapshot
First-Order Theory of the Degrees of Recursive Unsolvability
inferred← citeshttps://doi.org/10.2307/1993604openalex-snapshot
Recursive Enumerability and the Jump Operator
inferred← citeshttps://doi.org/10.2307/2271892openalex-snapshot
A survey of partial degrees
inferred← citeshttps://doi.org/10.2307/2272056openalex-snapshot
Mitotic recursively enumerable sets
inferred← citeshttps://doi.org/10.2307/2272313openalex-snapshot
Transfinite extensions of Friedberg's completeness criterion
inferred← citeshttps://doi.org/10.2307/2272899openalex-snapshot
A minimal degree not realizing least possible jump
inferred← citeshttps://doi.org/10.2307/2273221openalex-snapshot
Degrees joining to 0′
inferred← citeshttps://doi.org/10.2307/2273476openalex-snapshot
Kleene index sets and functional m-degrees
inferred← citeshttps://doi.org/10.2307/2273547openalex-snapshot
Forcing and reducibilities
inferred← citeshttps://doi.org/10.2307/2274273openalex-snapshot
Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
inferred← citeshttps://doi.org/10.2307/2274851openalex-snapshot
A jump class of noncappable degrees
inferred← citeshttps://doi.org/10.2307/2275914openalex-snapshot
Almost weakly 2-generic sets
inferred← citeshttps://doi.org/10.2307/2586587openalex-snapshot
Models of arithmetic and subuniform bounds for the arithmetic sets
inferred← citeshttps://doi.org/10.2307/2964288openalex-snapshot
Measure-theoretic construction of incomparable hyperdegrees
inferred← citeshttps://doi.org/10.2307/421198openalex-snapshot
1995 European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.23638/lmcs-14(3:13)2018openalex-snapshot
A Galois connection between Turing jumps and limits
inferred← citeshttps://doi.org/10.3233/com-180092openalex-snapshot
S. Barry Cooper (1943–2015)
inferred← citeshttps://doi.org/10.32657/10356/75914openalex-snapshot
On equivalence relations and bounded turing degrees
inferred← citeshttps://doi.org/10.3792/pja/1195522199openalex-snapshot
On complete degrees
inferred← citeshttps://doi.org/10.4099/math1924.13.381openalex-snapshot
1-Generic degrees and minimal degrees in higher recursion theory
inferred← citeshttps://doi.org/10.48550/arxiv.1501.05327openalex-snapshot
Turing jumps through provability
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.