Nonhemimaximal degrees and the high/low hierarchy

DOI10.2178/jsl/1333566631zbMath1247.03075OpenAlexW1498986034MaRDI QIDQ2892668

Chengling Fang, Guohua Wu

Publication date: 19 June 2012

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

Full work available at URL: https://projecteuclid.org/euclid.jsl/1333566631

zbMATH Keywords

high/low hierarchynonhemimaximal degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Cites Work

• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Jumps of Hemimaximal Sets
• Highness and bounding minimal pairs
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Recursively enumerable sets of positive integers and their decision problems

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