Jumps of Hemimaximal Sets
From MaRDI portal
Publication:3982858
DOI10.1002/malq.19910370802zbMath0739.03026MaRDI QIDQ3982858
Publication date: 26 June 1992
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19910370802
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
The Complexity of Orbits of Computably Enumerable Sets, Friedberg splittings of recursively enumerable sets, Splitting theorems in recursion theory, Some orbits for \({\mathcal E}\), Orbits of computably enumerable sets: Low sets can avoid an upper cone, There is no fat orbit, Nonhemimaximal degrees and the high/low hierarchy, Definable incompleteness and Friedberg splittings