Translator Disclaimer
December 2006 Properly Σ⁰₂ enumeration degrees and the high/low hierarchy
Matthew Giorgi, Andrea Sorbi, Yue Yang
J. Symbolic Logic 71(4): 1125-1144 (December 2006). DOI: 10.2178/jsl/1164060448

Abstract

We show that there exist downwards properly Σ⁰₂ (in fact noncuppable) e-degrees that are not high. We also show that every high e-degree bounds a noncuppable e-degree.

Citation

Download Citation

Matthew Giorgi. Andrea Sorbi. Yue Yang. "Properly Σ⁰₂ enumeration degrees and the high/low hierarchy." J. Symbolic Logic 71 (4) 1125 - 1144, December 2006. https://doi.org/10.2178/jsl/1164060448

Information

Published: December 2006
First available in Project Euclid: 20 November 2006

zbMATH: 1114.03034
MathSciNet: MR2275852
Digital Object Identifier: 10.2178/jsl/1164060448

Subjects:
Primary: 03D30

Rights: Copyright © 2006 Association for Symbolic Logic

JOURNAL ARTICLE
20 PAGES

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

SHARE
Vol.71 • No. 4 • December 2006
Back to Top