Quasi-complements of the cappable degrees
✍ Scribed by Guohua Wu
- Publisher
- John Wiley and Sons
- Year
- 2004
- Tongue
- English
- Weight
- 208 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
Say that a nonzero c. e. degree b is a quasi‐complement of a c. e. degree a if a ∩ b = 0 and a ∪ b is high. It is well‐known (due to Shore) that each cappable degree has a high quasi‐complement. However, by the existence of the almost deep degrees, there are nonzero cappable degrees having no low quasi‐complements. In this paper, we prove that any nonzero cappable degree has a low~2~ quasi‐complement. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
📜 SIMILAR VOLUMES
A graph is called honest if its edge-integrity equals its order. It is shown in this paper that except for the path of length 3, every graph that is not honest has an honest complemenk. This result is extended to complements of products and applied to the Nordhaus-Gaddum theory for edgeintegrity.