Open Access
2007 Cuppability of Simple and Hypersimple Sets
Martin Kummer, Marcus Schaefer
Notre Dame J. Formal Logic 48(3): 349-369 (2007). DOI: 10.1305/ndjfl/1187031408

Abstract

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.

Citation

Download Citation

Martin Kummer. Marcus Schaefer. "Cuppability of Simple and Hypersimple Sets." Notre Dame J. Formal Logic 48 (3) 349 - 369, 2007. https://doi.org/10.1305/ndjfl/1187031408

Information

Published: 2007
First available in Project Euclid: 13 August 2007

zbMATH: 1132.03017
MathSciNet: MR2336352
Digital Object Identifier: 10.1305/ndjfl/1187031408

Subjects:
Primary: 03D30
Secondary: 03D25 , 03D28

Keywords: completeness , cuppability , hypersimple sets , simple sets , strong reducibilities

Rights: Copyright © 2007 University of Notre Dame

Vol.48 • No. 3 • 2007
Back to Top