On the public citation graph

A hierarchy of sets. I

https://doi.org/10.1007/bf02218750
0 signed · 128 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.1007/bf01969993openalex-snapshot
Ein Satz über die Elementar-Arithmetischen Definierbarkeitsklassen
inferredcites →https://doi.org/10.1090/s0002-9939-1966-0186541-3openalex-snapshot
Isomorphism Types of Index Sets of Partial Recursive Functions
inferredcites →https://doi.org/10.1090/s0002-9947-1956-0085187-3openalex-snapshot
Degrees of Computability
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/1521-3870(200210)48:1+<131::aid-malq131>3.0.co;2-#openalex-snapshot
Recursive Approximability of Real Numbers
inferred← citeshttps://doi.org/10.1002/malq.19740201309openalex-snapshot
Index Sets Universal for Differences of Arithmetic Sets
inferred← citeshttps://doi.org/10.1002/malq.19790251306openalex-snapshot
Extensional Characterization of Index Sets
inferred← citeshttps://doi.org/10.1002/malq.200310003openalex-snapshot
Approximate decidability in euclidean spaces
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.200310089openalex-snapshot
Quasi‐complements of the cappable degrees
inferred← citeshttps://doi.org/10.1002/malq.200310103openalex-snapshot
Degrees of d. c. e. reals
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.201020054openalex-snapshot
Rice and Rice-Shapiro Theorems for transfinite correction grammars
inferred← citeshttps://doi.org/10.1002/malq.201100114openalex-snapshot
Rogers semilattices of families of two embedded sets in the Ershov hierarchy
inferred← citeshttps://doi.org/10.1002/malq.201400109openalex-snapshot
Automorphisms ofη-like computable linear orderings and Kierstead's conjecture
inferred← citeshttps://doi.org/10.1002/malq.201500077openalex-snapshot
Fixed-parameter decidability: Extending parameterized complexity analysis
inferred← citeshttps://doi.org/10.1002/malq.202100004openalex-snapshot
Normalizing notations in the Ershov hierarchy
inferred← citeshttps://doi.org/10.1002/malq.202300020openalex-snapshot
A classification of low c.e. sets and the Ershov hierarchy
inferred← citeshttps://doi.org/10.1002/malq.202400024openalex-snapshot
Wadge degrees of Δ20$\mathbf{\Delta }^0_2$ omega‐powers
inferred← citeshttps://doi.org/10.1007/11494645_35openalex-snapshot
The Low Splitting Theorem in the Difference Hierarchy
inferred← citeshttps://doi.org/10.1007/11750321_68openalex-snapshot
Universal Cupping Degrees
inferred← citeshttps://doi.org/10.1007/11780342_60openalex-snapshot
A Computability Theory of Real Numbers
inferred← citeshttps://doi.org/10.1007/3-540-36169-3_2openalex-snapshot
Mathematics Based on Learning
inferred← citeshttps://doi.org/10.1007/3-540-36169-3_21openalex-snapshot
Learning, Logic, and Topology in a Common Framework
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_30openalex-snapshot
Binary Enumerability of Real Numbers (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_4openalex-snapshot
Generalized Boolean hierarchies and Boolean hierarchies over RP
inferred← citeshttps://doi.org/10.1007/978-0-387-69245-6_3openalex-snapshot
Computability and Computable Models
inferred← citeshttps://doi.org/10.1007/978-3-030-88708-7_1openalex-snapshot
Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy
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-319-50062-1_20openalex-snapshot
Strength and Weakness in Computable Structure Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_27openalex-snapshot
A Survey of Results on the d-c.e. and n-c.e. Degrees
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_33openalex-snapshot
Nondensity of Double Bubbles in the D.C.E. Degrees
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_62openalex-snapshot
Ershov’s Hierarchy of Real Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-45167-9_51openalex-snapshot
On Learning to Coordinate
inferred← citeshttps://doi.org/10.1007/978-3-540-72927-3_16openalex-snapshot
Learning Correction Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_12openalex-snapshot
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_43openalex-snapshot
Every $\Delta^0_2$ -Set Is Natural, Up to Turing Equivalence
inferred← citeshttps://doi.org/10.1007/bf00967763openalex-snapshot
Construction of the m-jump
inferred← citeshttps://doi.org/10.1007/bf01620618openalex-snapshot
Bounded query classes and the difference hierarchy
inferred← citeshttps://doi.org/10.1007/bf01980603openalex-snapshot
Completeness in the arithmetical hierarchy and fixed points
inferred← citeshttps://doi.org/10.1007/bf02218664openalex-snapshot
On a hierarchy of sets, II
inferred← citeshttps://doi.org/10.1007/bf02219732openalex-snapshot
Index sets of degrees of unsolvability
inferred← citeshttps://doi.org/10.1007/bf02785966openalex-snapshot
There exists a maximal 3-C.E. enumeration degree
inferred← citeshttps://doi.org/10.1007/bfb0023860openalex-snapshot
Quantifying the amount of verboseness (extended abstract)
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-009-0171-1openalex-snapshot
The limitations of cupping in the local structure of the enumeration degrees
inferred← citeshttps://doi.org/10.1007/s00153-014-0402-yopenalex-snapshot
Friedberg numberings in the Ershov hierarchy
inferred← citeshttps://doi.org/10.1007/s00153-020-00710-1openalex-snapshot
Classifying equivalence relations in the Ershov hierarchy
inferred← citeshttps://doi.org/10.1007/s00153-023-00896-0openalex-snapshot
On diagonal functions for equivalence relations
inferred← citeshttps://doi.org/10.1007/s00224-007-9026-5openalex-snapshot
Classification of Computably Approximable Real Numbers
inferred← citeshttps://doi.org/10.1007/s00224-009-9169-7openalex-snapshot
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
inferred← citeshttps://doi.org/10.1007/s10469-011-9146-5openalex-snapshot
Strongly η-representable degrees and limitwise monotonic functions
inferred← citeshttps://doi.org/10.1007/s10469-012-9162-0openalex-snapshot
Positive undecidable numberings in the Ershov hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-014-9290-9openalex-snapshot
Families Without Minimal Numberings
inferred← citeshttps://doi.org/10.1007/s10469-015-9329-6openalex-snapshot
The Branching Theorem and Computable Categoricity in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-015-9349-2openalex-snapshot
Friedberg Numberings in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-016-9390-9openalex-snapshot
Embeddability of the Semilattice L m 0 in Rogers Semilattices
inferred← citeshttps://doi.org/10.1007/s10469-018-9495-4openalex-snapshot
Turing Degrees in Refinements of the Arithmetical Hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-019-09538-yopenalex-snapshot
Weakly Precomplete Equivalence Relations in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-025-09780-7openalex-snapshot
CEA-Operators and the Ershov Hierarchy. I
inferred← citeshttps://doi.org/10.1007/s10958-021-05422-2openalex-snapshot
Precomplete Numberings
inferred← citeshttps://doi.org/10.1007/s11202-010-0111-7openalex-snapshot
Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy
inferred← citeshttps://doi.org/10.1007/s11229-023-04056-yopenalex-snapshot
How to approximate fuzzy sets: mind-changes and the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1016/0003-4843(75)90005-4openalex-snapshot
Small recursive ordinals, many-one degrees, and the arithmetical difference hierarchy
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90145-0openalex-snapshot
Convex subsets of 2n and bounded truth-table reducibility
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00067-4openalex-snapshot
Effective inseparability in a topological setting
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/j.aim.2012.06.005openalex-snapshot
Characterizing the strongly jump-traceable sets via randomness
inferred← citeshttps://doi.org/10.1016/j.apal.2008.06.010openalex-snapshot
Computable categoricity and the Ershov hierarchy
inferred← citeshttps://doi.org/10.1016/j.apal.2011.12.029openalex-snapshot
Fine hierarchies via Priestley duality
inferred← citeshttps://doi.org/10.1016/j.apal.2014.01.003openalex-snapshot
Inside the Muchnik degrees I: Discontinuity, learnability and constructivism
inferred← citeshttps://doi.org/10.1016/j.apal.2014.04.008openalex-snapshot
Avoiding uniformity in the Δ20 enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2019.102716openalex-snapshot
Reductions between types of numberings
inferred← citeshttps://doi.org/10.1016/j.apal.2019.102766openalex-snapshot
Turing reducibility in the fine hierarchy
inferred← citeshttps://doi.org/10.1016/j.dam.2026.02.004openalex-snapshot
Paths, ends and the separation problem for infinite graphs
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.entcs.2006.08.019openalex-snapshot
Classification of the Computable Approximations by Divergence Boundings
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.019openalex-snapshot
Finitely Bounded Effective Computability
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.022openalex-snapshot
On the Difference Hierarchy in Countably Based T0-Spaces
inferred← citeshttps://doi.org/10.1016/j.ic.2007.06.003openalex-snapshot
The boolean hierarchy of NP-partitions
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105354openalex-snapshot
On cardinalities of Rogers semilattices for families in the Ershov hierarchy
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.10.014openalex-snapshot
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.018openalex-snapshot
Unifying logic, topology and learning in Parametric logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.06.007openalex-snapshot
Random reals à la Chaitin with or without prefix-freeness
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/j.tcs.2011.09.020openalex-snapshot
On the number of infinite sequences with trivial initial segment complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.040openalex-snapshot
Computation as an unbounded process
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.004openalex-snapshot
Lowness for bounded randomness
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(98)80005-0openalex-snapshot
Chapter 4 Computable classes of constructive models
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80010-4openalex-snapshot
Chapter 9 Constructive models of finitely axiomatizable theories
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80053-0openalex-snapshot
Chapter 20 Generally constructive boolean algebras
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80030-5openalex-snapshot
Theory of Numberings
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00090-2openalex-snapshot
Abstract complexity theory and the Δ20 degrees
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/s0022481200051938openalex-snapshot
Boolean combinations of r.e. open sets
inferred← citeshttps://doi.org/10.1017/s0960129506005603openalex-snapshot
Restricted jump interpolation in the d.c.e. degrees
inferred← citeshttps://doi.org/10.1017/s1755020316000253openalex-snapshot
TRIAL AND ERROR MATHEMATICS II: DIALECTICAL SETS AND QUASIDIALECTICAL SETS, THEIR DEGREES, AND THEIR DISTRIBUTION WITHIN THE CLASS OF LIMIT SETS
inferred← citeshttps://doi.org/10.1023/b:allo.0000004175.64588.32openalex-snapshot
Positive Numberings of Families of Sets in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1023/b:allo.0000035115.44324.5dopenalex-snapshot
Difference Hierarchy in ϕ-Spaces
inferred← citeshttps://doi.org/10.1090/s0002-9947-1973-0349365-8openalex-snapshot
Discrete 𝜔-sequences of index sets
inferred← citeshttps://doi.org/10.1093/logcom/exm033openalex-snapshot
Algorithmic Randomness of Closed Sets
inferred← citeshttps://doi.org/10.1109/sct.1991.160245openalex-snapshot
Bounded queries in recursion theory: a survey
inferred← citeshttps://doi.org/10.1134/s0037446621010031openalex-snapshot
On Universal Pairs in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1134/s0081543812070024openalex-snapshot
Model-theoretic properties of turing degrees in the Ershov difference hierarchy
inferred← citeshttps://doi.org/10.1134/s1995080214040209openalex-snapshot
A survey of results on the d.c.e. and n-c.e. degrees
inferred← citeshttps://doi.org/10.1134/s199508021606010xopenalex-snapshot
Elementary theories and structural properties of d-c.e. and n-c.e. degrees
inferred← citeshttps://doi.org/10.1134/s1995080224601322openalex-snapshot
Special Splitting in the 2-c.e. Turing Degrees
inferred← citeshttps://doi.org/10.1142/9781848162778_0003openalex-snapshot
The Ershov Hierarchy
inferred← citeshttps://doi.org/10.1142/s0219061312500055openalex-snapshot
THE n-r.e. DEGREES: UNDECIDABILITY AND Σ1 SUBSTRUCTURES
inferred← citeshttps://doi.org/10.1215/00294527-2025-0002openalex-snapshot
A Nonsplitting Theorem in the Low2 Turing Degrees
inferred← citeshttps://doi.org/10.2178/jsl/1080938842openalex-snapshot
Parsimony hierarchies for inductive inference
inferred← citeshttps://doi.org/10.2178/jsl/1208359060openalex-snapshot
Randomness, lowness and degrees
inferred← citeshttps://doi.org/10.2178/jsl/1243948324openalex-snapshot
Learning correction grammars
inferred← citeshttps://doi.org/10.2307/2272349openalex-snapshot
Index sets in Ershov's hierarchy
inferred← citeshttps://doi.org/10.2307/2272633openalex-snapshot
A noninitial segment of index sets
inferred← citeshttps://doi.org/10.2307/2273509openalex-snapshot
Classifications of generalized index sets of open classes
inferred← citeshttps://doi.org/10.2307/2274273openalex-snapshot
Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
inferred← citeshttps://doi.org/10.2307/2586839openalex-snapshot
Relative enumerability in the difference hierarchy
inferred← citeshttps://doi.org/10.3103/s1066369x10120066openalex-snapshot
Decomposability of low 2-computably enumerable degrees and turing jumps in the Ershov hierarchy
inferred← citeshttps://doi.org/10.3103/s1066369x21080089openalex-snapshot
CEA Operators and the Ershov Hierarchy
inferred← citeshttps://doi.org/10.3103/s1066369x21100017openalex-snapshot
Asymptotic Density and Computability
inferred← citeshttps://doi.org/10.3233/com-170080openalex-snapshot
Linearisations and the Ershov hierarchy
inferred← citeshttps://doi.org/10.3233/com-180085openalex-snapshot
Extending Cooper’s theorem to Δ 3 0 Turing degrees
inferred← citeshttps://doi.org/10.48550/arxiv.1109.6749openalex-snapshot
Characterizing the strongly jump-traceable sets via randomness
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.