On the public citation graph
A Jump Inversion Theorem for the Degree Spectra
0 signed · 55 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.1002/malq.19710170139openalex-snapshot
Arithmetical Reducibilities I
inferredcites →https://doi.org/10.1007/11494645_56openalex-snapshot
Minimal Pairs and Quasi-minimal Degrees for the Joint Spectra of Structures
inferredcites →https://doi.org/10.1007/s001530050156openalex-snapshot
A jump inversion theorem for the enumeration jump
inferredcites →https://doi.org/10.1023/b:allo.0000048826.92325.02openalex-snapshot
Complexity of Categorical Theories with Computable Models
inferredcites →https://doi.org/10.1112/s0024610700001459openalex-snapshot
Every Set has a Least Jump Enumeration
inferredcites →https://doi.org/10.2307/2274181openalex-snapshot
Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
inferredcites →https://doi.org/10.2307/2274335openalex-snapshot
Jumps of quasi-minimal enumeration degrees
inferredcites →https://doi.org/10.2307/2274752openalex-snapshot
Non Σn axiomatizable almost strongly minimal theories
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.201800015openalex-snapshot
Jump inversions of algebraic structures and Σ‐definability
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_18openalex-snapshot
Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_19openalex-snapshot
Enumeration Reducibility and Computable Structure Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-21875-0_32openalex-snapshot
Conservative Extensions of Abstract Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-39053-1_43openalex-snapshot
A Note on ω-Jump Inversion of Degree Spectra of Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-39053-1_46openalex-snapshot
On Processes and Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-39053-1_49openalex-snapshot
Another Jump Inversion Theorem for Structures
inferred← citeshttps://doi.org/10.1007/s10469-011-9153-6openalex-snapshot
Fixed points for the jump operator
inferred← citeshttps://doi.org/10.1007/s10469-018-9488-3openalex-snapshot
Jump Inversions of Algebraic Structures and the Σ-Definability
inferred← citeshttps://doi.org/10.1007/s10469-023-09714-1openalex-snapshot
Families of Permutations and Ideals of Turing Degrees
inferred← citeshttps://doi.org/10.1007/s10469-025-09777-2openalex-snapshot
Permutation Groups and Ideals of Turing Degrees
inferred← citeshttps://doi.org/10.1017/9781108525749.004openalex-snapshot
Existentially-Atomic Models
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/cbo9781139028592.010openalex-snapshot
Effective model theory: approach via σ-definability
inferred← citeshttps://doi.org/10.1017/jsl.2016.12openalex-snapshot
COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
inferred← citeshttps://doi.org/10.1017/jsl.2016.73openalex-snapshot
TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
inferred← citeshttps://doi.org/10.1017/jsl.2019.91openalex-snapshot
CODING IN GRAPHS AND LINEAR ORDERINGS
inferred← citeshttps://doi.org/10.1017/jsl.2022.66openalex-snapshot
EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER
inferred← citeshttps://doi.org/10.1093/logcom/exaf034openalex-snapshot
Relations enumerable from positive information
inferred← citeshttps://doi.org/10.1093/logcom/ext041openalex-snapshot
Effective properties of Marker's extensions
inferred← citeshttps://doi.org/10.1201/b21197-8openalex-snapshot
Arithmetic Hierarchy and Enumeration Degrees
inferred← citeshttps://doi.org/10.1215/00294527-2017-0032openalex-snapshot
Coding and Definability in Computable Structures
inferred← citeshttps://doi.org/10.2178/jsl.7802050openalex-snapshot
A fixed point for the jump operator on structures
inferred← citeshttps://doi.org/10.3103/s1055134410010037openalex-snapshot
A jump inversion theorem for the semilattices of sigma-degrees
inferred← citeshttps://doi.org/10.3233/com-180095openalex-snapshot
Isomorphism and classification for countable structures
inferred← citeshttps://doi.org/10.48550/arxiv.1106.0908openalex-snapshot
A fixed point for the jump operator on structures
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.