A Dichotomy of the Recursively Enumerable Sets

DOI10.1002/MALQ.19680142105MaRDI QIDQ5620591zbMATH OpenOpenAlexFDO

Authors R. W. Robinson

Publication date 1968

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19680142105

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Cited in

(14)

• Automorphisms of the lattice of recursively enumerable sets: Orbits
• r-maximal major subsets
• Some lowness properties and computational complexity sequences
• Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees
• Interpolating d-r.e. and REA degrees between r.e. degrees
• Deficiency Sets and Bounded Information Reducibilities
• Minimal degrees and the jump operator
• Determining Automorphisms of the Recursively Enumerable Sets
• Recursively enumerable sets and degrees
• Computational complexity, speedable and levelable sets
• Speed-Ups by changing the order in which sets are enumerated
• Recursively enumerable sets which are uniform for finite extensions
• Weak density and cupping in the d-r.e. degrees
• Computably enumerable sets and related issues

This page was built for publication: A Dichotomy of the Recursively Enumerable Sets

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