Translator Disclaimer
June 2012 Nonhemimaximal degrees and the high/low hierarchy
Chengling Fang, Guohua Wu
J. Symbolic Logic 77(2): 433-446 (June 2012). DOI: 10.2178/jsl/1333566631

Abstract

After showing the downwards density of nonhemimaximal degrees, Downey and Stob continued to prove that the existence of a low₂, but not low, nonhemimaximal degree, and their proof uses the fact that incomplete m-topped degrees are low₂ but not low. As commented in their paper, the construction of such a nonhemimaximal degree is actually a primitive 0''' argument. In this paper, we give another construction of such degrees, which is a standard 0''-argument, much simpler than Downey and Stob's construction mentioned above.

Citation

Download Citation

Chengling Fang. Guohua Wu. "Nonhemimaximal degrees and the high/low hierarchy." J. Symbolic Logic 77 (2) 433 - 446, June 2012. https://doi.org/10.2178/jsl/1333566631

Information

Published: June 2012
First available in Project Euclid: 4 April 2012

zbMATH: 1247.03075
MathSciNet: MR2963015
Digital Object Identifier: 10.2178/jsl/1333566631

Rights: Copyright © 2012 Association for Symbolic Logic

JOURNAL ARTICLE
14 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.77 • No. 2 • June 2012
Back to Top