On the public citation graph

Orderings with αth Jump Degree 0 (α)

https://doi.org/10.2307/2159679
0 signed · 17 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 points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11494645_56openalex-snapshot
Minimal Pairs and Quasi-minimal Degrees for the Joint Spectra of Structures
inferred← citeshttps://doi.org/10.1007/11780342_56openalex-snapshot
Relativized Degree Spectra
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_38openalex-snapshot
Notes on the Jump of a Structure
inferred← citeshttps://doi.org/10.1007/s00153-004-0245-zopenalex-snapshot
The jump operation for structure degrees
inferred← citeshttps://doi.org/10.1007/s10469-006-0017-4openalex-snapshot
Δ 2 0 -copies of linear orderings
inferred← citeshttps://doi.org/10.1007/s10469-015-9362-5openalex-snapshot
Effective Categoricity of Computable Linear Orderings
inferred← citeshttps://doi.org/10.1016/j.apal.2019.05.004openalex-snapshot
Categorical linearly ordered structures
inferred← citeshttps://doi.org/10.1017/jsl.2014.69openalex-snapshot
COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
inferred← citeshttps://doi.org/10.1017/jsl.2016.73openalex-snapshot
TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
inferred← citeshttps://doi.org/10.1090/s0002-9939-07-08845-4openalex-snapshot
Turing degrees of nonabelian groups
inferred← citeshttps://doi.org/10.1090/s0002-9939-1994-1203984-4openalex-snapshot
Every Low Boolean Algebra is Isomorphic to a Recursive One
inferred← citeshttps://doi.org/10.1093/logcom/exn024openalex-snapshot
A Jump Inversion Theorem for the Degree Spectra
inferred← citeshttps://doi.org/10.1112/jlms/jdl012openalex-snapshot
Turing degrees of isomorphism types of algebraic objects
inferred← citeshttps://doi.org/10.1142/9789811278631_0004openalex-snapshot
Isomorphism Types of Rogers Semilattices in the Analytical Hierarchy
inferred← citeshttps://doi.org/10.2178/bsl/1182353917openalex-snapshot
Computability-Theoretic Complexity of Countable Structures
inferred← citeshttps://doi.org/10.2178/jsl.7704020openalex-snapshot
Jump degrees of torsion-free abelian groups
inferred← citeshttps://doi.org/10.2307/2275695openalex-snapshot
Boolean algebras, Stone spaces, and the iterated Turing jump
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.