On the public citation graph

Genericity for recursively enumerable sets

https://doi.org/10.1007/bfb0076222
0 signed · 35 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/bf02760850openalex-snapshot
Splitting properties and jump classes
inferredcites →https://doi.org/10.1007/bfb0067135openalex-snapshot
Degrees of Unsolvability: Structure and Theory
inferredcites →https://doi.org/10.1007/bfb0090941openalex-snapshot
Three easy constructions of recursively enumerable sets
inferredcites →https://doi.org/10.1017/cbo9780511629181.002openalex-snapshot
Fundamental Methods for Constructing Recursively Enumerable Degrees
inferredcites →https://doi.org/10.1017/cbo9780511629181.004openalex-snapshot
Degrees of Generic Sets
inferredcites →https://doi.org/10.1017/s0022481200051598openalex-snapshot
The infinite injury priority method
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://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
inferredcites →https://doi.org/10.1090/s0002-9947-1984-0737882-5openalex-snapshot
On Pairs of Recursively Enumerable Degrees
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1112/plms/s3-16.1.537openalex-snapshot
Lower Bounds for Pairs of Recursively Enumerable Degrees
inferredcites →https://doi.org/10.2307/2272252openalex-snapshot
The infinite injury priority method
inferredcites →https://doi.org/10.2307/2273100openalex-snapshot
Recursively enumerable generic sets
inferredcites →https://doi.org/10.2307/2273510openalex-snapshot
Double jumps of minimal degrees
inferredcites →https://doi.org/10.2307/2273796openalex-snapshot
Variations on promptly simple 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.19920380114openalex-snapshot
TOPOLOGICAL FRAMEWORK FOR FINITE INJURY
inferred← citeshttps://doi.org/10.1002/malq.19940400302openalex-snapshot
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees
inferred← citeshttps://doi.org/10.1007/3-540-45066-1_7openalex-snapshot
Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata
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/bf01269953openalex-snapshot
The distribution of the generic recursively enumerable degrees
inferred← citeshttps://doi.org/10.1007/bf02561545openalex-snapshot
Non-p-generic and strongly nonbranching degree
inferred← citeshttps://doi.org/10.1007/bfb0076211openalex-snapshot
Recursion Theory Week
inferred← citeshttps://doi.org/10.1007/bfb0076226openalex-snapshot
Generic objects in recursion theory
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/0304-3975(87)90053-3openalex-snapshot
Diagonalizations over polynomial time computable sets
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00014-1openalex-snapshot
Dynamic notions of genericity and array noncomputability
inferred← citeshttps://doi.org/10.1090/s0002-9947-1987-0879565-xopenalex-snapshot
T-Degrees, Jump Classes, and Strong Reducibilities
inferred← citeshttps://doi.org/10.1142/9789812796554_0001openalex-snapshot
GENERATING SETS FOR THE RECURSIVELY ENUMERABLE TURING DEGREES
inferred← citeshttps://doi.org/10.1201/b21197-9openalex-snapshot
Peano Arithmetic Models and Computability
inferred← citeshttps://doi.org/10.2307/2274854openalex-snapshot
A limit on relative genericity in the recursively enumerable sets
inferred← citeshttps://doi.org/10.2307/2275003openalex-snapshot
Annual Meeting of the Association for Symbolic Logic, Los Angeles, 1989
inferred← citeshttps://doi.org/10.3233/com-180088openalex-snapshot
Automorphism bases for the recursively enumerable degrees
inferred← citeshttps://doi.org/10.32657/10356/139815openalex-snapshot
Computability theory and 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.