On the public citation graph
Automorphism bases for degrees of unsolvability
0 signed · 39 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.1002/malq.19690150707openalex-snapshot
The degrees of bi‐immune sets
inferredcites →https://doi.org/10.1007/978-1-4615-9964-7openalex-snapshot
Measure and Category: A Survey of the Analogies between Topological and Measure Spaces
inferredcites →https://doi.org/10.1007/bf02761181openalex-snapshot
On automorphisms of the degrees that preserve jumps
inferredcites →https://doi.org/10.1016/0003-4843(77)90018-3openalex-snapshot
Measure and minimal degrees
inferredcites →https://doi.org/10.1016/0003-4843(80)90004-2openalex-snapshot
Reducibility orderings: Theories, definability and automorphisms
inferredcites →https://doi.org/10.1016/s0049-237x(08)71260-6openalex-snapshot
Second order logic and first order theories of reducibility orderings*
inferredcites →https://doi.org/10.1017/s0305004100052221openalex-snapshot
Banach–Mazur games, comeager sets and degrees of unsolvability
inferredcites →https://doi.org/10.1090/s0002-9939-1977-0446931-5openalex-snapshot
Determining Automorphisms of the Recursively Enumerable Sets
inferredcites →https://doi.org/10.1090/s0273-0979-1981-14871-0openalex-snapshot
Definable degrees and automorphisms of 𝒟
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2307/1969604openalex-snapshot
On Degrees of Recursive Unsolvability
inferredcites →https://doi.org/10.2307/2272735openalex-snapshot
Decidability of the “almost all” theory of degrees
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.4153/cjm-1971-024-7openalex-snapshot
Solution to a Problem of Spector
inferredcites →https://doi.org/10.4153/cjm-1972-113-9openalex-snapshot
Degrees in Which the Recursive Sets are Uniformly Recursive
inferredcites →https://doi.org/10.4153/cjm-1977-105-5openalex-snapshot
Simple Proofs of Some Theorems on High Degrees of Unsolvability
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01793784openalex-snapshot
On some filters and ideals of the Medvedev lattice
inferred← citeshttps://doi.org/10.1007/bfb0076212openalex-snapshot
Generators of the recursively enumerable degrees
inferred← citeshttps://doi.org/10.1007/bfb0099479openalex-snapshot
Minimal degrees and 1-generic sets below 0′
inferred← citeshttps://doi.org/10.1016/0003-4843(80)90004-2openalex-snapshot
Reducibility orderings: Theories, definability and automorphisms
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80046-7openalex-snapshot
Rigidity and definability in the noncomputable universe
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70956-xopenalex-snapshot
The Structures of Recursion Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80020-2openalex-snapshot
Local Degree Theory* *Preparation of this paper partially supported by E.P.S.R.C. research grants nos. GR/H91213 and GR/H02165, and by EC Human Capital and Mobility network ‘Complexity, Logic and Recursion Theory’.
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80021-4openalex-snapshot
The Global Structure of the Turing Degrees
inferred← citeshttps://doi.org/10.1016/s0168-0072(03)00024-1openalex-snapshot
Homomorphisms and quotients of degree structures
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00076-6openalex-snapshot
Sets of generators and automorphism bases for the enumeration degrees
inferred← citeshttps://doi.org/10.1017/9781316718254.005openalex-snapshot
Definability and global degree theory
inferred← citeshttps://doi.org/10.1017/9781316756140.013openalex-snapshot
Hartley Rogers’ 1965 Agenda
inferred← citeshttps://doi.org/10.1142/9789812794055_0002openalex-snapshot
GLOBAL PROPERTIES OF THE TURING DEGREES AND THE TURING JUMP
inferred← citeshttps://doi.org/10.1201/b21197-9openalex-snapshot
Peano Arithmetic Models and Computability
inferred← citeshttps://doi.org/10.2307/2274668openalex-snapshot
Some remarks on the algebraic structure of the Medvedev Lattice
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.