Jumps of Hemimaximal Sets

DOI10.1002/malq.19910370802zbMath0739.03026OpenAlexW2155433742MaRDI QIDQ3982858

Mike Stob, Rodney G. Downey

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

zbMATH Keywords

jumpsr.e. sethemimaximal setslow\(_ 2\) degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (8)

Nonhemimaximal degrees and the high/low hierarchy ⋮ There is no fat orbit ⋮ The Complexity of Orbits of Computably Enumerable Sets ⋮ Friedberg splittings of recursively enumerable sets ⋮ Some orbits for \({\mathcal E}\) ⋮ Orbits of computably enumerable sets: Low sets can avoid an upper cone ⋮ Splitting theorems in recursion theory ⋮ Definable incompleteness and Friedberg splittings

This page was built for publication: Jumps of Hemimaximal Sets