On the public citation graph

Codable sets and orbits of computably enumerable sets

https://doi.org/10.2307/2586583
0 signed · 34 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.1002/malq.19660120125openalex-snapshot
Classes of Recursively Enumerable Sets and Degrees of Unsolvability
inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bf02760850openalex-snapshot
Splitting properties and jump classes
inferredcites →https://doi.org/10.1016/b978-044450423-4/50007-3openalex-snapshot
Systems of logic based on ordinals
inferredcites →https://doi.org/10.1016/s0168-0072(97)00069-9openalex-snapshot
Definable properties of the computably enumerable sets
inferredcites →https://doi.org/10.1017/s0022481200051252openalex-snapshot
Degrees of classes of RE sets
inferredcites →https://doi.org/10.1073/pnas.88.22.10242openalex-snapshot
Post's program and incomplete recursively enumerable sets.
inferredcites →https://doi.org/10.1090/memo/0541openalex-snapshot
Automorphisms of the lattice of recursively enumerable sets
inferredcites →https://doi.org/10.1090/s0002-9904-1944-08111-1openalex-snapshot
Recursively enumerable sets of positive integers and their decision problems
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-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/s0894-0347-96-00181-6openalex-snapshot
The Δ₃⁰-automorphism method and noninvariant classes of degrees
inferredcites →https://doi.org/10.1112/plms/s2-45.1.161openalex-snapshot
Systems of Logic Based on Ordinals†
inferredcites →https://doi.org/10.1215/s0012-7094-68-03513-8openalex-snapshot
The elementary theory of recursively enumerable sets
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/1970579openalex-snapshot
On Some Games Which Are Relevant to the Theory of Recursively Enumerable Sets
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/2273100openalex-snapshot
Recursively enumerable generic sets
inferredcites →https://doi.org/10.2307/2273796openalex-snapshot
Variations on promptly simple sets
inferredcites →https://doi.org/10.2307/420992openalex-snapshot
Computability and Recursion

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-43669-2_5openalex-snapshot
Some Recent Research Directions in the Computably Enumerable Sets
inferred← citeshttps://doi.org/10.1007/978-94-017-0487-8_12openalex-snapshot
Computability and Enumerability
inferred← citeshttps://doi.org/10.1016/j.apal.2009.06.007openalex-snapshot
Extending and interpreting Post’s programme
inferred← citeshttps://doi.org/10.1016/j.apal.2012.02.001openalex-snapshot
On n -tardy 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(00)00060-9openalex-snapshot
Some orbits for E
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00069-9openalex-snapshot
Definable properties of the computably enumerable sets
inferred← citeshttps://doi.org/10.1090/jams/1996-9-03openalex-snapshot
inferred← citeshttps://doi.org/10.1090/s0894-0347-08-00604-8openalex-snapshot
On the orbits of computably enumerable sets
inferred← citeshttps://doi.org/10.2178/bsl/1208358844openalex-snapshot
The Complexity of Orbits of Computably Enumerable Sets
inferred← citeshttps://doi.org/10.2178/bsl/1333560809openalex-snapshot
2011 North American Annual Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2307/2586618openalex-snapshot
Implicit measurements of dynamic complexity properties and splittings of speedable sets
inferred← citeshttps://doi.org/10.48550/arxiv.1312.5979openalex-snapshot
Some recent research directions in the computably enumerable sets
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.