On the public citation graph
Recursively enumerable generic sets
0 signed · 58 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.1016/0003-4843(82)90016-xopenalex-snapshot
Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
inferredcites →https://doi.org/10.1090/s0002-9904-1974-13350-1openalex-snapshot
Automorphisms of the lattice of recursively enumerable sets
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2140/pjm.1980.87.135openalex-snapshot
d-simple sets, small sets, and degree classes
inferredcites →https://doi.org/10.2307/1970842openalex-snapshot
Automorphisms of the Lattice of Recursively Enumerable Sets Part I: Maximal Sets
inferredcites →https://doi.org/10.2307/2271876openalex-snapshot
Computational complexity, speedable and levelable sets
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.200310060openalex-snapshot
A minimal pair joining to a plus cupping Turing degree
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_1openalex-snapshot
The Work of Anil Nerode: A Retrospective
inferred← citeshttps://doi.org/10.1007/978-3-642-77735-6_2openalex-snapshot
Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory
inferred← citeshttps://doi.org/10.1007/bf01269953openalex-snapshot
The distribution of the generic recursively enumerable degrees
inferred← citeshttps://doi.org/10.1007/bf02007561openalex-snapshot
Cupping and noncapping in the r.e. weak truth table and turing degrees
inferred← citeshttps://doi.org/10.1007/bf02760850openalex-snapshot
Splitting properties and jump classes
inferred← citeshttps://doi.org/10.1007/bfb0016258openalex-snapshot
P-genericity and strong p-genericity
inferred← citeshttps://doi.org/10.1007/bfb0016275openalex-snapshot
An alternative, priority-free, solution to Post's problem
inferred← citeshttps://doi.org/10.1007/bfb0076222openalex-snapshot
Genericity for recursively enumerable sets
inferred← citeshttps://doi.org/10.1007/bfb0076226openalex-snapshot
Generic objects in recursion theory
inferred← citeshttps://doi.org/10.1007/s10469-026-09829-1openalex-snapshot
Uniform Constructions in Computability Theory
inferred← citeshttps://doi.org/10.1016/0003-4843(82)90016-xopenalex-snapshot
Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90073-4openalex-snapshot
Generic objects in recursion theory II: Operations on recursive approximation spaces
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90234-5openalex-snapshot
Splitting theorems in recursion theory
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90053-3openalex-snapshot
Diagonalizations over polynomial time computable sets
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90081-3openalex-snapshot
A remark on the length problem
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/j.apal.2005.10.004openalex-snapshot
Bounding computably enumerable degrees in the Ershov hierarchy
inferred← citeshttps://doi.org/10.1016/j.apal.2015.10.004openalex-snapshot
Duality, non-standard elements, and dynamic properties of r.e. sets
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)80082-xopenalex-snapshot
Computational complexity of recursively enumerable sets
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70655-xopenalex-snapshot
On the Role of O' in Recursion Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80022-6openalex-snapshot
The Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80023-8openalex-snapshot
An Overview of the Computably Enumerable Sets
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00069-9openalex-snapshot
Definable properties of the computably enumerable sets
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00014-1openalex-snapshot
Dynamic notions of genericity and array noncomputability
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00110-4openalex-snapshot
Presentations of computably enumerable reals
inferred← citeshttps://doi.org/10.1017/bsl.2014.14openalex-snapshot
NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS
inferred← citeshttps://doi.org/10.1090/conm/257/04040openalex-snapshot
Natural definability in degree structures
inferred← citeshttps://doi.org/10.1090/s0002-9939-1994-1209095-6openalex-snapshot
Permutations and Presentations
inferred← citeshttps://doi.org/10.1090/s0002-9947-1983-0704618-2openalex-snapshot
Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.1090/s0002-9947-1984-0719661-8openalex-snapshot
An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-1984-0735425-3openalex-snapshot
The Quotient Semilattice of the Recursively Enumerable Degrees Modulo the Cappable Degrees
inferred← citeshttps://doi.org/10.1090/s0894-0347-96-00181-6openalex-snapshot
The Δ₃⁰-automorphism method and noninvariant classes of degrees
inferred← citeshttps://doi.org/10.1093/logcom/exq049openalex-snapshot
Prompt enumerations and relative randomness
inferred← citeshttps://doi.org/10.1201/b21197-9openalex-snapshot
Peano Arithmetic Models and Computability
inferred← citeshttps://doi.org/10.2178/bsl/1122038994openalex-snapshot
The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.2178/jsl/1190150103openalex-snapshot
On orbits, of prompt and low computably enumerable sets
inferred← citeshttps://doi.org/10.2307/2273666openalex-snapshot
Forcing and reducibilities. III. Forcing in fragments of set theory
inferred← citeshttps://doi.org/10.2307/2273948openalex-snapshot
Pairs without infimum in the recursively enumerable weak truth table degrees
inferred← citeshttps://doi.org/10.2307/2274854openalex-snapshot
A limit on relative genericity in the recursively enumerable sets
inferred← citeshttps://doi.org/10.2307/2275754openalex-snapshot
Degree theoretic definitions of the low2 recursively enumerable sets
inferred← citeshttps://doi.org/10.2307/2586583openalex-snapshot
Codable sets and orbits of computably enumerable sets
inferred← citeshttps://doi.org/10.32657/10356/165558openalex-snapshot
Cupping in the computably enumerable degrees
inferred← citeshttps://doi.org/10.32657/10356/46540openalex-snapshot
Contributions to degree 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.