Bounded-low sets and the high/low hierarchy

DOI10.1007/S00153-020-00726-7OpenAlexW3013755225MaRDI QIDQ2204374

Huishan Wu

Publication date: 15 October 2020

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-020-00726-7

zbMATH Keywords

computably enumerable setslow setsbounded-low setssuperhigh sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Turing machines and related notions (03D10)

Cites Work

• Unnamed Item
• Unnamed Item
• A superhigh diamond in the c.e. tt-degrees
• Effective domination and the bounded jump
• Classical recursion theory. The theory of functions and sets of natural numbers
• Bounded jump and the high/low hierarchy
• Bounded low and high sets
• A bounded jump for the bounded Turing degrees
• Limits on jump inversion for strong reducibilities
• On very high degrees

This page was built for publication: Bounded-low sets and the high/low hierarchy