On the public citation graph

Splitting properties and jump classes

https://doi.org/10.1007/bf02760850
0 signed · 43 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/bf02761377openalex-snapshot
r-Maximal major subsets
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.1017/s0022481200051252openalex-snapshot
Degrees of classes of RE sets
inferredcites →https://doi.org/10.1017/s0022481200051598openalex-snapshot
The infinite injury priority method
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.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and 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.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/2270328openalex-snapshot
Degrees of recursively enumerable sets which have no maximal supersets
inferredcites →https://doi.org/10.2307/2271891openalex-snapshot
One hundred and two problems in mathematical logic
inferredcites →https://doi.org/10.2307/2273100openalex-snapshot
Recursively enumerable generic 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.1007/bf01980610openalex-snapshot
Property of t-retraceability and automorphisms of a lattice of recursively enumerable sets
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/bfb0076222openalex-snapshot
Genericity for recursively enumerable sets
inferred← citeshttps://doi.org/10.1007/bfb0086116openalex-snapshot
Array nonrecursive sets and multiple permitting arguments
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)90071-0openalex-snapshot
Structural interactions of the recursively enumerable T- and W-degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90092-ropenalex-snapshot
Friedberg splittings of recursively enumerable sets
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(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.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(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.1017/9781316755846.007openalex-snapshot
Interpreting arithmetic in the r.e. degrees under Σ4-induction
inferred← citeshttps://doi.org/10.1017/jsl.2015.70openalex-snapshot
COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS
inferred← citeshttps://doi.org/10.1090/jams/1996-9-03openalex-snapshot
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/s0002-9947-1992-1097164-6openalex-snapshot
Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
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.1142/s0219061302000151openalex-snapshot
ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
inferred← citeshttps://doi.org/10.2307/2273796openalex-snapshot
Variations on promptly simple sets
inferred← citeshttps://doi.org/10.2307/2274851openalex-snapshot
A jump class of noncappable degrees
inferred← citeshttps://doi.org/10.2307/2586583openalex-snapshot
Codable sets and orbits of computably enumerable sets
inferred← citeshttps://doi.org/10.2307/421206openalex-snapshot
Definable Encodings in the Computably Enumerable Sets
inferred← citeshttps://doi.org/10.3233/com-180088openalex-snapshot
Automorphism bases for the recursively enumerable degrees
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.