Properly enumeration degrees and the high/low hierarchy

DOI10.2178/JSL/1164060448zbMath1114.03034OpenAlexW1499122305MaRDI QIDQ3416107

Yue Yang, Matthew B. Giorgi, Andrea Sorbi

Publication date: 19 January 2007

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1164060448

zbMATH Keywords

high degreeslow degreesenumeration reducibility

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)

Related Items (1)

Definability via Kalimullin pairs in the structure of the enumeration degrees

Cites Work

• Properly Σ2 Enumeration Degrees
• On minimal pairs of enumeration degrees

This page was built for publication: Properly enumeration degrees and the high/low hierarchy