Degrees of classes of RE sets

DOI10.2307/2272046zbMATH Open0366.02029OpenAlexW4246124948MaRDI QIDQ4140972FDOQ4140972

Authors: Joseph R. Shoenfield 

Publication date: 1976

Published in: 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)

Cited In (16)

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

This page was built for publication: Degrees of classes of RE sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4140972)