On the public citation graph
Hierarchies of sets and degrees below 0′
0 signed · 70 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.1016/b978-0-7204-2233-7.50009-5openalex-snapshot
THE METHOD OF ALTERNATING CHAINS**This research was supported in part by the U.S. National Science Foundation under Grant GP-1842.
inferredcites →https://doi.org/10.1090/memo/0162openalex-snapshot
Minimal degrees of unsolvability and the full approximation construction
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1515/9781400881840openalex-snapshot
Degrees of Unsolvability. (AM-55)
inferredcites →https://doi.org/10.2307/2270581openalex-snapshot
Trial and error predicates and the solution to a problem of Mostowski
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.19960420138openalex-snapshot
Recursive Structures and Ershov's Hierarchy
inferred← citeshttps://doi.org/10.1002/malq.200310022openalex-snapshot
Effective embeddings into strong degree structures
inferred← citeshttps://doi.org/10.1002/malq.200310046openalex-snapshot
The discrete parts of approximately decidable sets in Euclidean spaces
inferred← citeshttps://doi.org/10.1002/malq.200310108openalex-snapshot
Characterizations of the class Δta2 over Euclidean spaces
inferred← citeshttps://doi.org/10.1002/malq.200310110openalex-snapshot
Weak computability and representation of reals
inferred← citeshttps://doi.org/10.1002/malq.200710011openalex-snapshot
Hierarchies of Δ02‐measurable k ‐partitions
inferred← citeshttps://doi.org/10.1002/malq.201020054openalex-snapshot
Rice and Rice-Shapiro Theorems for transfinite correction grammars
inferred← citeshttps://doi.org/10.1007/3-540-58907-4_28openalex-snapshot
Revision programming, database updates and integrity constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-40189-8_25openalex-snapshot
Program Size Complexity of Correction Grammars in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-540-72927-3_16openalex-snapshot
Learning Correction Grammars
inferred← citeshttps://doi.org/10.1007/bf00968696openalex-snapshot
Hierarchy of limiting computations
inferred← citeshttps://doi.org/10.1007/bf01620618openalex-snapshot
Bounded query classes and the difference hierarchy
inferred← citeshttps://doi.org/10.1007/bf01978670openalex-snapshot
A conjecture of ershov for a relative hierarchy fails near o'
inferred← citeshttps://doi.org/10.1007/bf01978879openalex-snapshot
Hierearchies of hyperarithmetical sets and functions
inferred← citeshttps://doi.org/10.1007/bf02785966openalex-snapshot
There exists a maximal 3-C.E. enumeration degree
inferred← citeshttps://doi.org/10.1007/bf02937291openalex-snapshot
Weak density and cupping in the d-r.e. degrees
inferred← citeshttps://doi.org/10.1007/bfb0029617openalex-snapshot
On checking versus evaluation of multiple queries
inferred← citeshttps://doi.org/10.1007/bfb0086111openalex-snapshot
On the structure of degrees below O′
inferred← citeshttps://doi.org/10.1007/s00153-005-0317-8openalex-snapshot
The Hausdorff-Ershov Hierarchy in Euclidean Spaces
inferred← citeshttps://doi.org/10.1007/s00153-019-00701-xopenalex-snapshot
Scott sentences for equivalence structures
inferred← citeshttps://doi.org/10.1007/s001530050139openalex-snapshot
On relative enumerability of Turing degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90005-7openalex-snapshot
The d.r.e. degrees are not dense
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90035-3openalex-snapshot
Extremes in the degrees of inferability
inferred← citeshttps://doi.org/10.1016/0168-0072(96)00014-0openalex-snapshot
Interpolating d-r.e. and REA degrees between r.e. degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2019.102766openalex-snapshot
Turing reducibility in the fine hierarchy
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.034openalex-snapshot
Hierarchies of Function Classes Defined by the First-Value Operator
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.06.031openalex-snapshot
Fine hierarchies and m-reducibilities in theoretical computer science
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70045-4openalex-snapshot
Degrees of Functions with no Fixed Points
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80002-5openalex-snapshot
Chapter 1 Pure computable model theory
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(01)00094-xopenalex-snapshot
Degree spectra of relations on structures of finite computable dimension
inferred← citeshttps://doi.org/10.1016/s0168-0072(96)00011-5openalex-snapshot
Permitting, forcing, and copying of a given recursive relation
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00056-0openalex-snapshot
Turing degrees of certain isomorphic images of computable relations
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00054-2openalex-snapshot
On the finiteness of the recursive chromatic number
inferred← citeshttps://doi.org/10.1017/cbo9780511629167.003openalex-snapshot
On isolating r.e. and isolated d-r.e. degrees
inferred← citeshttps://doi.org/10.1017/s0022481200041104openalex-snapshot
Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
inferred← citeshttps://doi.org/10.1051/ita/2010020openalex-snapshot
Function operators spanning the arithmetical and the polynomial hierarchy
inferred← citeshttps://doi.org/10.1109/sct.1988.5282openalex-snapshot
On truth-table reducibility to SAT and the difference hierarchy over NP
inferred← citeshttps://doi.org/10.1109/sct.1991.160245openalex-snapshot
Bounded queries in recursion theory: a survey
inferred← citeshttps://doi.org/10.1112/blms/21.1.43openalex-snapshot
D.R.E. Degrees and the Nondiamond Theorem
inferred← citeshttps://doi.org/10.1134/s0081543812070024openalex-snapshot
Model-theoretic properties of turing degrees in the Ershov difference hierarchy
inferred← citeshttps://doi.org/10.1145/168304.168319openalex-snapshot
On the structure of degrees of inferability
inferred← citeshttps://doi.org/10.1305/ndjfl/1071505769openalex-snapshot
Realizing Levels of the Hyperarithmetic Hierarchy as Degree Spectra of Relations on Computable Structures
inferred← citeshttps://doi.org/10.2178/jsl/1080938842openalex-snapshot
Parsimony hierarchies for inductive inference
inferred← citeshttps://doi.org/10.2307/2274273openalex-snapshot
Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
inferred← citeshttps://doi.org/10.2307/2275710openalex-snapshot
Embedding lattices into the wtt-degrees below 0′
inferred← citeshttps://doi.org/10.2307/2275754openalex-snapshot
Degree theoretic definitions of the low2 recursively enumerable sets
inferred← citeshttps://doi.org/10.2307/2695024openalex-snapshot
Degree spectra of intrinsically c.e. relations
inferred← citeshttps://doi.org/10.2307/421207openalex-snapshot
Degree Spectra of Relations on Computable Structures
inferred← citeshttps://doi.org/10.26686/wgtn.14776377openalex-snapshot
Collapse in a Transfinite Hierarchy of Turing Degrees
inferred← citeshttps://doi.org/10.26686/wgtn.14776377.v1openalex-snapshot
Collapse in a Transfinite Hierarchy of Turing Degrees
inferred← citeshttps://doi.org/10.3233/com-200297openalex-snapshot
Maximality and collapse in the hierarchy of α -c.a. degrees
inferred← citeshttps://doi.org/10.4213/spm26openalex-snapshot
Теоретико-модельные свойства тьюринговых степеней разностной иерархии Ершова
inferred← citeshttps://doi.org/10.48550/arxiv.1111.2480openalex-snapshot
The Distance Function on a Computable Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1412.3842openalex-snapshot
Degree Spectra of Relations on a Cone
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.