On the public citation graph
Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
0 signed · 74 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.1007/bfb0067135openalex-snapshot
Degrees of Unsolvability: Structure and Theory
inferredcites →https://doi.org/10.1017/cbo9780511629181openalex-snapshot
Recursion Theory, its Generalisations and Applications
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2307/2273104openalex-snapshot
Partial degrees and the density problem
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
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.19870330608openalex-snapshot
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
inferred← citeshttps://doi.org/10.1002/malq.19880340603openalex-snapshot
Properly Σ2 Enumeration Degrees
inferred← citeshttps://doi.org/10.1002/malq.19980440402openalex-snapshot
Some Special Pairs of Σ2 e‐Degrees
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/978-1-4613-0609-2_17openalex-snapshot
1-Generic Enumeration Degrees Below O e ’
inferred← citeshttps://doi.org/10.1007/978-1-4615-0755-0_15openalex-snapshot
Local Properties of the Non-Total Enumeration Degrees
inferred← citeshttps://doi.org/10.1007/978-3-031-36978-0_2openalex-snapshot
The Relationship Between Local and Global Structure in the Enumeration Degrees
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_19openalex-snapshot
Enumeration Reducibility and Computable Structure Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_59openalex-snapshot
Cupping Classes of $\Sigma^0_2$ Enumeration Degrees
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_76openalex-snapshot
A Jump Inversion Theorem for the Degree Spectra
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_77openalex-snapshot
Cupping $\Delta_2^0$ Enumeration Degrees to 0 e ′
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_6openalex-snapshot
Strong Positive Reducibilities
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_44openalex-snapshot
The Turing Universe in the Context of Enumeration Reducibility
inferred← citeshttps://doi.org/10.1007/bf01794984openalex-snapshot
Then-rea enumeration degrees are dense
inferred← citeshttps://doi.org/10.1007/bf02785966openalex-snapshot
There exists a maximal 3-C.E. enumeration degree
inferred← citeshttps://doi.org/10.1007/bf02808174openalex-snapshot
Branching in the enumeration degrees of the Σ 2 0 sets
inferred← citeshttps://doi.org/10.1007/bfb0086114openalex-snapshot
Enumeration reducibility, nondeterministic computations and relative computability of partial functions
inferred← citeshttps://doi.org/10.1007/s00153-002-0161-zopenalex-snapshot
Limit lemmas and jump inversion in the enumeration degrees
inferred← citeshttps://doi.org/10.1007/s00153-004-0245-zopenalex-snapshot
The jump operation for structure degrees
inferred← citeshttps://doi.org/10.1007/s00153-006-0012-4openalex-snapshot
Strong Enumeration Reducibilities
inferred← citeshttps://doi.org/10.1007/s00153-006-0021-3openalex-snapshot
A high noncuppable $${\Sigma^0_2}$$ e-degree
inferred← citeshttps://doi.org/10.1007/s00153-008-0081-7openalex-snapshot
Branching in the $${\Sigma^0_2}$$ -enumeration degrees: a new perspective
inferred← citeshttps://doi.org/10.1007/s00153-009-0171-1openalex-snapshot
The limitations of cupping in the local structure of the enumeration degrees
inferred← citeshttps://doi.org/10.1007/s00153-015-0471-6openalex-snapshot
A note on the enumeration degrees of 1-generic sets
inferred← citeshttps://doi.org/10.1007/s00153-021-00766-7openalex-snapshot
The automorphism group and definability of the jump operator in the $$\omega $$-enumeration degrees
inferred← citeshttps://doi.org/10.1007/s001530050156openalex-snapshot
A jump inversion theorem for the enumeration jump
inferred← citeshttps://doi.org/10.1016/0168-0072(90)90051-3openalex-snapshot
On restricted forms of enumeration reducibility
inferred← citeshttps://doi.org/10.1016/j.apal.2009.01.003openalex-snapshot
The jump operator on the ω -enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2009.01.009openalex-snapshot
A non-splitting theorem in the enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.012openalex-snapshot
Empty intervals in the enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2014.01.007openalex-snapshot
The automorphism group of the enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2018.01.001openalex-snapshot
Density of the cototal enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2025.103616openalex-snapshot
The singleton degrees of the Σ20 sets are not dense
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115324openalex-snapshot
A discrete linear order with non-dense punctual degrees
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.1016/s0168-0072(96)00009-7openalex-snapshot
Cupping and noncupping in the enumeration degrees of ∑20 sets
inferred← citeshttps://doi.org/10.1017/9781316755723.015openalex-snapshot
Ash's theorem for abstract structures
inferred← citeshttps://doi.org/10.1017/9781316756140.006openalex-snapshot
Relative Splittings of in the-Enumeration Degrees
inferred← citeshttps://doi.org/10.1017/bsl.2016.17openalex-snapshot
IN MEMORIAM: BARRY COOPER 1943–2015
inferred← citeshttps://doi.org/10.1017/jsl.2014.84openalex-snapshot
INITIAL SEGMENTS OF THE ENUMERATION DEGREES
inferred← citeshttps://doi.org/10.1017/jsl.2022.55openalex-snapshot
PA RELATIVE TO AN ENUMERATION ORACLE
inferred← citeshttps://doi.org/10.1017/s0960129508007378openalex-snapshot
Cupping Δ20 enumeration degrees to 0e′
inferred← citeshttps://doi.org/10.1017/s0960129510000216openalex-snapshot
Diamond embeddings into the enumeration degrees
inferred← citeshttps://doi.org/10.1090/jams/848openalex-snapshot
Defining totality in the enumeration degrees
inferred← citeshttps://doi.org/10.1090/s0002-9939-1988-0934883-8openalex-snapshot
On Quasi-Minimal e-Degrees and Total e-Degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-2014-06157-6openalex-snapshot
Definability via Kalimullin pairs in the structure of the enumeration degrees
inferred← citeshttps://doi.org/10.1090/tran/7604openalex-snapshot
On cototality and the skip operator in the enumeration degrees
inferred← citeshttps://doi.org/10.1093/jigpal/jzaf011openalex-snapshot
Computable operators on left–c.e. reals and their continuity properties
inferred← citeshttps://doi.org/10.1093/logcom/exn024openalex-snapshot
A Jump Inversion Theorem for the Degree Spectra
inferred← citeshttps://doi.org/10.1093/logcom/ext041openalex-snapshot
Effective properties of Marker's extensions
inferred← citeshttps://doi.org/10.1093/logcom/ext045openalex-snapshot
Quasi-minimal degrees for degree spectra
inferred← citeshttps://doi.org/10.1134/s0037446613060177openalex-snapshot
Complements for enumeration Π01-degrees
inferred← citeshttps://doi.org/10.1134/s1055134422040010openalex-snapshot
On Numberings for Classes of Families of Total Functions
inferred← citeshttps://doi.org/10.1142/s0219061303000285openalex-snapshot
DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
inferred← citeshttps://doi.org/10.1142/s0219061305000432openalex-snapshot
ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS
inferred← citeshttps://doi.org/10.18255/1818-1015-2012-3-74-80openalex-snapshot
About Not Countable Ideals in a Semi-Lattice of the Enumeration Degrees
inferred← citeshttps://doi.org/10.18255/1818-1015-2022-2-104-114openalex-snapshot
Enumeration Degrees of the Bounded Sets
inferred← citeshttps://doi.org/10.3233/com-170072openalex-snapshot
The jump hierarchy in the enumeration degrees
inferred← citeshttps://doi.org/10.3233/com-210380openalex-snapshot
Extensions of two constructions of Ahmad
inferred← citeshttps://doi.org/10.5281/zenodo.188226openalex-snapshot
FIGURES 71–78 in A taxonomic study of the Indian species of Euops Schoenherr (Coleoptera: Curculionoidea: Attelabidae)
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.