Degrees of classes of RE sets

DOI10.2307/2272046MaRDI QIDQ4140972zbMATH OpenOpenAlexFDO

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)

• Determining Automorphisms of the Recursively Enumerable Sets
• Turing computability: structural theory
• A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
• Computably enumerable sets that are automorphic to low sets
• Computably enumerable sets and related issues
• Recursively enumerable sets and degrees
• Minimal pairs in initial segments of the recursively enumerable degrees
• Splitting theorems in recursion theory
• Splitting properties and jump classes
• ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• ON SUPERSETS OF NON-LOW SETS
• \(r\)-maximal major subsets
• The nonlow computably enumerable degrees are not invariant in \(\mathcal{E}\)
• 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

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)