A Dichotomy of the Recursively Enumerable Sets
From MaRDI portal
Publication:5620591
DOI10.1002/malq.19680142105zbMath0217.01202OpenAlexW1984887166MaRDI QIDQ5620591
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
Related Items
Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees, Deficiency Sets and Bounded Information Reducibilities, Interpolating \(d\)-r.e. and REA degrees between r.e. degrees, Speed-Ups by changing the order in which sets are enumerated, Recursively enumerable sets which are uniform for finite extensions, Minimal degrees and the jump operator, Automorphisms of the lattice of recursively enumerable sets: Orbits, Computably enumerable sets and related issues, Weak density and cupping in the d-r.e. degrees, \(r\)-maximal major subsets, Some lowness properties and computational complexity sequences, Recursively enumerable sets and degrees, Computational complexity, speedable and levelable sets, Determining Automorphisms of the Recursively Enumerable Sets