Degrees of classes of RE sets

DOI10.2307/2272046zbMath0366.02029OpenAlexW4246124948MaRDI QIDQ4140972

J. R. Shoenfield

Publication date: 1976

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272046

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees, ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS, A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets, Minimal pairs in initial segments of the recursively enumerable degrees, Computably enumerable sets that are automorphic to low sets, Extending and interpreting Post's programme, Splitting properties and jump classes, Automorphisms of the lattice of recursively enumerable sets: Orbits, The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$, Computably enumerable sets and related issues, \(r\)-maximal major subsets, Turing computability: structural theory, Recursively enumerable sets and degrees, ON SUPERSETS OF NON-LOW SETS, Splitting theorems in recursion theory, Determining Automorphisms of the Recursively Enumerable Sets