An incomplete degree is cuppable if it can be joined by an incomplete degree to a complete degree. For sets fulfilling some type of simplicity property one can now ask whether these sets are cuppable with respect to a certain type of reducibilities. Several such results are known. In this paper we settle all the remaining cases for the standard notions of simplicity and all the main strong reducibilities.
@article{1187031408,
author = {Kummer, Martin and Schaefer, Marcus},
title = {Cuppability of Simple and Hypersimple Sets},
journal = {Notre Dame J. Formal Logic},
volume = {48},
number = {1},
year = {2007},
pages = { 349-369},
language = {en},
url = {http://dml.mathdoc.fr/item/1187031408}
}
Kummer, Martin; Schaefer, Marcus. Cuppability of Simple and Hypersimple Sets. Notre Dame J. Formal Logic, Tome 48 (2007) no. 1, pp. 349-369. http://gdmltest.u-ga.fr/item/1187031408/